Base | Representation |
---|---|
bin | 1010111010100011101010… |
… | …0111010100101101100000 |
3 | 1120111021222211100012220110 |
4 | 2232220322213110231200 |
5 | 3033111244213341000 |
6 | 41305123410411320 |
7 | 2346023663654352 |
oct | 256507247245540 |
9 | 46437884305813 |
10 | 12001122012000 |
11 | 3907713564050 |
12 | 1419a93590b40 |
13 | 690915ca9704 |
14 | 2d6c00a0b0d2 |
15 | 15c29b6a3850 |
hex | aea3a9d4b60 |
12001122012000 has 192 divisors, whose sum is σ = 42889828520448. Its totient is φ = 2909362880000.
The previous prime is 12001122011959. The next prime is 12001122012029. The reversal of 12001122012000 is 21022110021.
12001122012000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45326796 + ... + 45590795.
It is an arithmetic number, because the mean of its divisors is an integer number (223384523544).
Almost surely, 212001122012000 is an apocalyptic number.
12001122012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12001122012000 is an abundant number, since it is smaller than the sum of its proper divisors (30888706508448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12001122012000 is a wasteful number, since it uses less digits than its factorization.
12001122012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90917630 (or 90917612 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12001122012000 its reverse (21022110021), we get a palindrome (12022144122021).
The spelling of 12001122012000 in words is "twelve trillion, one billion, one hundred twenty-two million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •