# 1072171 (number)

1,072,171 (one million seventy-two thousand one hundred seventy-one) is an odd seven-digits composite number following 1072170 and preceding 1072172. In scientific notation, it is written as 1.072171 × 106. The sum of its digits is 19. It has a total of 2 prime factors and 4 positive divisors. There are 1,057,000 positive integers (up to 1072171) that are relatively prime to 1072171.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 7
• Sum of Digits 19
• Digital Root 1

## Name

Short name 1 million 72 thousand 171 one million seventy-two thousand one hundred seventy-one

## Notation

Scientific notation 1.072171 × 106 1.072171 × 106

## Prime Factorization of 1072171

Prime Factorization 71 × 15101

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 1072171 Product of the distinct prime numbers λ(n) 1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 1 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 1,072,171 is 71 × 15101. Since it has a total of 2 prime factors, 1,072,171 is a composite number.

## Divisors of 1072171

4 divisors

 Even divisors 0 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 1.08734e+06 Sum of all the positive divisors of n s(n) 15173 Sum of the proper positive divisors of n A(n) 271836 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 1035.46 Returns the nth root of the product of n divisors H(n) 3.94418 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 1,072,171 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 1,072,171) is 1,087,344, the average is 271,836.

## Other Arithmetic Functions (n = 1072171)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 1057000 Total number of positive integers not greater than n that are coprime to n λ(n) 105700 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 83542 Total number of primes less than or equal to n r2(n) 0 The number of ways n can be represented as the sum of 2 squares

There are 1,057,000 positive integers (less than 1,072,171) that are coprime with 1,072,171. And there are approximately 83,542 prime numbers less than or equal to 1,072,171.

## Divisibility of 1072171

 m n mod m 2 3 4 5 6 7 8 9 1 1 3 1 1 2 3 1

1,072,171 is not divisible by any number less than or equal to 9.

## Classification of 1072171

• Arithmetic
• Semiprime
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (1072171)

Base System Value
2 Binary 100000101110000101011
3 Ternary 2000110202001
4 Quaternary 10011300223
5 Quinary 233302141
6 Senary 34551431
8 Octal 4056053
10 Decimal 1072171
12 Duodecimal 438577
20 Vigesimal 6e08b
36 Base36 mzaj

## Basic calculations (n = 1072171)

### Multiplication

n×y
 n×2 2144342 3216513 4288684 5360855

### Division

n÷y
 n÷2 536086 357390 268043 214434

### Exponentiation

ny
 n2 1149550653241 1232514873436056211 1321466704366809823804081 1416838277887666855597845329851

### Nth Root

y√n
 2√n 1035.46 102.35 32.1785 16.0714

## 1072171 as geometric shapes

### Circle

 Diameter 2.14434e+06 6.73665e+06 3.61142e+12

### Sphere

 Volume 5.16275e+18 1.44457e+13 6.73665e+06

### Square

Length = n
 Perimeter 4.28868e+06 1.14955e+12 1.51628e+06

### Cube

Length = n
 Surface area 6.8973e+12 1.23251e+18 1.85705e+06

### Equilateral Triangle

Length = n
 Perimeter 3.21651e+06 4.9777e+11 928527

### Triangular Pyramid

Length = n
 Surface area 1.99108e+12 1.45253e+17 875424

## Cryptographic Hash Functions

md5 94325471549749d402e52e0d3f416b9b 485bc93d7d7967296735bf0b6c3c2fa4ae9030f5 8551b8633f522261e1ee71d46c70c9e657dd344f6e2b8fb7bb07b0f0fc1e36fb 8eabf938f6baf098e40717f39e26d8047f22f00741c23c47966405a098d381afb32fdaef7ae4d8fcb86f30a383aea4027eb03255eead0301b6fd157088630e21 58a0ca1d7e3b82590b064900962a88b93fa633ae
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}