Base | Representation |
---|---|
bin | 1010111011001100100100… |
… | …1000100000011011010000 |
3 | 1120112100100010000201022002 |
4 | 2232303021020200123100 |
5 | 3033301241332310000 |
6 | 41314141155333132 |
7 | 2346563052625652 |
oct | 256631110403320 |
9 | 46470303021262 |
10 | 12012103010000 |
11 | 3911338aa3405 |
12 | 1420038bb11a8 |
13 | 691975cacc72 |
14 | 2d75631726d2 |
15 | 15c6e073c8d5 |
hex | aecc92206d0 |
12012103010000 has 200 divisors, whose sum is σ = 29277685941504. Its totient is φ = 4772658240000.
The previous prime is 12012103009979. The next prime is 12012103010041. The reversal of 12012103010000 is 1030121021.
It is a tau number, because it is divible by the number of its divisors (200).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1750266569 + ... + 1750273431.
Almost surely, 212012103010000 is an apocalyptic number.
12012103010000 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 12012103010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14638842970752).
12012103010000 is an abundant number, since it is smaller than the sum of its proper divisors (17265582931504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012103010000 is an equidigital number, since it uses as much as digits as its factorization.
12012103010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8039 (or 8018 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 12012103010000 its reverse (1030121021), we get a palindrome (12013133131021).
The spelling of 12012103010000 in words is "twelve trillion, twelve billion, one hundred three million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •