Base | Representation |
---|---|
bin | 1010111011110010010001… |
… | …0001011001011101010000 |
3 | 1120120022110022200202202120 |
4 | 2232330210101121131100 |
5 | 3033433002313031000 |
6 | 41322533232414240 |
7 | 2350401603633240 |
oct | 256744421313520 |
9 | 46508408622676 |
10 | 12022222002000 |
11 | 39156609a0911 |
12 | 1421ba19a7380 |
13 | 6928c95305b2 |
14 | 2d7c4302bb20 |
15 | 15cad3ca26a0 |
hex | aef24459750 |
12022222002000 has 320 divisors, whose sum is σ = 44331621594624. Its totient is φ = 2745772339200.
The previous prime is 12022222001947. The next prime is 12022222002019. The reversal of 12022222002000 is 20022222021.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 53521924 + ... + 53746076.
Almost surely, 212022222002000 is an apocalyptic number.
12022222002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12022222002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22165810797312).
12022222002000 is an abundant number, since it is smaller than the sum of its proper divisors (32309399592624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022222002000 is a wasteful number, since it uses less digits than its factorization.
12022222002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225463 (or 225447 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 12022222002000 its reverse (20022222021), we get a palindrome (12042244224021).
The spelling of 12022222002000 in words is "twelve trillion, twenty-two billion, two hundred twenty-two million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •