Base | Representation |
---|---|
bin | 1010111010100111000001… |
… | …0001101110011110000000 |
3 | 1120111101022120102121022012 |
4 | 2232221300101232132000 |
5 | 3033120120203220000 |
6 | 41305353011232052 |
7 | 2346055205315126 |
oct | 256516021563600 |
9 | 46441276377265 |
10 | 12002022320000 |
11 | 3908035786849 |
12 | 141a0a4ba8628 |
13 | 690a2a68033b |
14 | 2d6c88407916 |
15 | 15c300741735 |
hex | aea7046e780 |
12002022320000 has 80 divisors (see below), whose sum is σ = 29878284638400. Its totient is φ = 4800808896000.
The previous prime is 12002022319943. The next prime is 12002022320003. The reversal of 12002022320000 is 2322020021.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002022320003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 74932640 + ... + 75092639.
It is an arithmetic number, because the mean of its divisors is an integer number (373478557980).
Almost surely, 212002022320000 is an apocalyptic number.
12002022320000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12002022320000 is an abundant number, since it is smaller than the sum of its proper divisors (17876262318400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12002022320000 is an frugal number, since it uses more digits than its factorization.
12002022320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150025313 (or 150025286 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 12002022320000 its reverse (2322020021), we get a palindrome (12004344340021).
The spelling of 12002022320000 in words is "twelve trillion, two billion, twenty-two million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •