Base | Representation |
---|---|
bin | 11101010001110101101… |
… | …111100111101010000000 |
3 | 21010100101010210210210102 |
4 | 131101311233213222000 |
5 | 230431104122041000 |
6 | 4140150445421532 |
7 | 265235506525253 |
oct | 35216557475200 |
9 | 7110333723712 |
10 | 2012020112000 |
11 | 706324999948 |
12 | 285b3956a8a8 |
13 | 11796a91b292 |
14 | 6d54d02509a |
15 | 3750d3c23d5 |
hex | 1d475be7a80 |
2012020112000 has 64 divisors (see below), whose sum is σ = 5002385043240. Its totient is φ = 804808038400.
The previous prime is 2012020111979. The next prime is 2012020112009. The reversal of 2012020112000 is 2110202102.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 209917916224 + 1802102195776 = 458168^2 + 1342424^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (2012020112009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62859629 + ... + 62891628.
Almost surely, 22012020112000 is an apocalyptic number.
2012020112000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2012020112000 is an abundant number, since it is smaller than the sum of its proper divisors (2990364931240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012020112000 is an equidigital number, since it uses as much as digits as its factorization.
2012020112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125751286 (or 125751264 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2012020112000 its reverse (2110202102), we get a palindrome (2014130314102).
The spelling of 2012020112000 in words is "two trillion, twelve billion, twenty million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •