20118969 (number)
20118969 is an odd 8-digits composite number following 20118968 and preceding 20118970. In scientific notation, it is written as 2.0118969 × 10^7. The sum of its digits is 36. It has a total of 6 prime factors and 48 positive divisors. There are 11702880 positive integers (up to 20118969) that are relatively prime to 20118969.
Interesting facts
- 20118969 has 48 divisors, whose sum is 33922560
- The reverse of 20118969 is 96981102
- Previous prime number is 43
Basic properties
- Is Prime? no
- Number parity odd
- Number length 8
- Sum of Digits 36
- Digital Root 9
Name
| Name | twenty million one hundred eighteen thousand nine hundred sixty-nine |
|---|
Notation
| Scientific notation | 2.0118969 × 10^7 |
|---|---|
| Engineering notation | 2.0118969 × 10^6 |
Prime Factorization of 20118969
Prime Factorization 3 × 9 × 31 × 13 × 43 × 43
Composite number| ω | Distinct Factors | 5 | Total number of distinct prime factors |
|---|---|---|---|
| Ω | Total Factors | 6 | Total number of prime factors |
| rad | Radical | 467883 | Product of the distinct prime numbers |
The prime factorization of 20118969 is 3 × 9 × 31 × 13 × 43 × 43. Since it has a total of 6 prime factors.
Most popular turbo-numbers
Basic calculations (n = 20118969)
Multiplication
n×y| n×2 | 40237938 |
|---|---|
| n×3 | 60356907 |
| n×4 | 80475876 |
| n×5 | 100594845 |
Division
n÷y| n÷2 | 10059484.5 |
|---|---|
| n÷3 | 6706323 |
| n÷3 | 5029742.25 |
| n÷5 | 4023793.8 |
Exponentiation
ny| n2 | 404772913622961 |
|---|---|
| n3 | 8.14361370122E+21 |
| n4 | 1.6384111160282E+29 |
| n5 | 3.2963142452627E+36 |
Nth Root
y√n| 2√n | 4485.4173718841 |
|---|---|
| 3√n | 271.97891723125 |
| 4√n | 66.973258632712 |
| 5√n | 28.888244043749 |
Divisors of 20118969
48 divisors
| τ | Total Divisors | 48 | Total number of the positive divisors of n |
|---|---|---|---|
| σ | Sum of Divisors | 1 | Sum of all the positive divisors of n |
| s | Aliquot Sum | -20118968 | Sum of the proper positive divisors of n |
| A | Arithmetic Mean | 0.020833333333333 | 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 | 48 | Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors |
The number 20118969 can be divided by 48 positive divisors. The sum of these divisors (counting 20118969) is 1, the average is 0.020833333333333.
Base conversion 20118969
| Base | System | Value |
|---|---|---|
| 2 | Binary | 1001100101111110110111001 |
| 3 | Ternary | 1101212011001000 |
| 4 | Quaternary | 1030233312321 |
| 5 | Quinary | 20122301334 |
| 6 | Senary | 1555115213 |
| 8 | Octal | 114576671 |
| 10 | Decimal | 20118969 |
| 12 | Duodecimal | 68a2b09 |
| 16 | Hexadecimal | 132fdb9 |
| 20 | Vigesimal | 65eh89 |
| 36 | Base36 | bz7w9 |
Cryptographic Hash Functions
| md5 | c56d33ff05848656ae596afa1022df86 |
|---|---|
| sha1 | 84d9518a9dc05814b1a0be54ea39919207854e5c |
| sha256 | 62ac0f4af76b1513cd52d28d81010cfe197fdd37e1f2c5d0dfe3a628b751aee4 |
| sha512 | d4c7b46cf52f2d8c8912940c3a18b5ebc7723a84bc88e986b26f81a7fcac9828587da6cd2d648a3ecf651d91e7852eebf999523aff97db599ecca8163007b75f |
| ripemd-160 | 8dd461c05cd8f623a534dbe2c334c0638f2af22e |
20118969 as geometric shapes
Circle
Radius = n| Diameter | 40237938 |
|---|---|
| Circumference | 126411210.4164 |
| Area | 1.27163161181E+15 |
Sphere
Radius = n| Volume | 3.4111889303235E+22 |
|---|---|
| Surface area | 5.0865264472401E+15 |
| Circumference | 126411210.4164 |
Square
Length = n| Perimeter | 80475876 |
|---|---|
| Area | 404772913622961 |
| Diagonal | 28452518.820764 |
Cube
Length = n| Surface area | 2428637481737766 |
|---|---|
| Volume | 8.14361370122E+21 |
| Space diagonal | 34847076.503903 |
Equilateral Triangle
Length = n| Perimeter | 60356907 |
|---|---|
| Area | 1.7527181298066E+14 |
| Altitude | 17423538.251952 |
Triangular Pyramid
Length = n| Surface area | 1.7527181298066E+14 |
|---|---|
| Volume | 9.5973407858273E+20 |
| Height | 9484172.9402546 |