20116032 (number)
20116032 is an even 8-digits composite number following 20116031 and preceding 20116033. In scientific notation, it is written as 2.0116032 × 10^7. The sum of its digits is 15. It has a total of 9 prime factors and 56 positive divisors. There are 6309888 positive integers (up to 20116032) that are relatively prime to 20116032.
Interesting facts
- 20116032 has 56 divisors, whose sum is 56363616
- The reverse of 20116032 is 23061102
- Previous prime number is 17
Basic properties
- Is Prime? no
- Number parity even
- Number length 8
- Sum of Digits 15
- Digital Root 6
Name
Name | twenty million one hundred sixteen thousand thirty-two |
---|
Notation
Scientific notation | 2.0116032 × 10^7 |
---|---|
Engineering notation | 2.0116032 × 10^6 |
Prime Factorization of 20116032
Prime Factorization 2 × 2 × 2 × 2 × 2 × 2 × 3 × 17 × 6163
Composite numberω | Distinct Factors | 4 | Total number of distinct prime factors |
---|---|---|---|
Ω | Total Factors | 9 | Total number of prime factors |
rad | Radical | 628626 | Product of the distinct prime numbers |
The prime factorization of 20116032 is 2 × 2 × 2 × 2 × 2 × 2 × 3 × 17 × 6163. Since it has a total of 9 prime factors.
Most popular turbo-numbers
Basic calculations (n = 20116032)
Multiplication
n×yn×2 | 40232064 |
---|---|
n×3 | 60348096 |
n×4 | 80464128 |
n×5 | 100580160 |
Division
n÷yn÷2 | 10058016 |
---|---|
n÷3 | 6705344 |
n÷3 | 5029008 |
n÷5 | 4023206.4 |
Exponentiation
nyn2 | 404654743425024 |
---|---|
n3 | 8.1400477676896E+21 |
n4 | 1.6374546137637E+29 |
n5 | 3.2939089409019E+36 |
Nth Root
y√n2√n | 4485.0899656529 |
---|---|
3√n | 271.96568194481 |
4√n | 66.970814282438 |
5√n | 28.887400563871 |
Divisors of 20116032
56 divisors
τ | Total Divisors | 56 | Total number of the positive divisors of n |
---|---|---|---|
σ | Sum of Divisors | 1 | Sum of all the positive divisors of n |
s | Aliquot Sum | -20116031 | Sum of the proper positive divisors of n |
A | Arithmetic Mean | 0.017857142857143 | Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) |
G | Geometric Mean | 1 | Returns the nth root of the product of n divisors |
H | Harmonic Mean | 56 | Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors |
The number 20116032 can be divided by 56 positive divisors. The sum of these divisors (counting 20116032) is 1, the average is 0.017857142857143.
Base conversion 20116032
Base | System | Value |
---|---|---|
2 | Binary | 1001100101111001001000000 |
3 | Ternary | 1101212000000020 |
4 | Quaternary | 1030233021000 |
5 | Quinary | 20122203112 |
6 | Senary | 1555053440 |
8 | Octal | 114571100 |
10 | Decimal | 20116032 |
12 | Duodecimal | 68a1280 |
16 | Hexadecimal | 132f240 |
20 | Vigesimal | 65ea1c |
36 | Base36 | bz5mo |
Cryptographic Hash Functions
md5 | 0c1fca5cd899299b9f27e8dda91f9af0 |
---|---|
sha1 | c0a9a9466982029171a966cc9e59a1556064f33b |
sha256 | 5e0e1dc3e29dd9cd0d3addaa720477c201fcb3a5a13df066eb6648c0f9d40e94 |
sha512 | 192a6c53c3ce945442916d59082df1fceb139f395bee6f00e166be2eb96fade3d86b63b455fcc045221e990a6c32dfc12d38209477ffe758be70f36147a32a2b |
ripemd-160 | f1d6c3ac2bb6dd0b3222c9928309d3db27f75446 |
20116032 as geometric shapes
Circle
Radius = nDiameter | 40232064 |
---|---|
Circumference | 126392756.70115 |
Area | 1.2712603691843E+15 |
Sphere
Radius = nVolume | 3.4096952355791E+22 |
---|---|
Surface area | 5.0850414767373E+15 |
Circumference | 126392756.70115 |
Square
Length = nPerimeter | 80464128 |
---|---|
Area | 404654743425024 |
Diagonal | 28448365.275531 |
Cube
Length = nSurface area | 2427928460550144 |
---|---|
Volume | 8.1400477676896E+21 |
Space diagonal | 34841989.470681 |
Equilateral Triangle
Length = nPerimeter | 60348096 |
---|---|
Area | 1.7522064378397E+14 |
Altitude | 17420994.735341 |
Triangular Pyramid
Length = nSurface area | 1.7522064378397E+14 |
---|---|
Volume | 9.5931382928595E+20 |
Height | 9482788.4251771 |