Base | Representation |
---|---|
bin | 1001001001010101101110… |
… | …01111010000111101000000 |
3 | 2122012200212121022002021011 |
4 | 10210222313033100331000 |
5 | 10114004100421041000 |
6 | 110435213140210304 |
7 | 4144023601526545 |
oct | 444526717207500 |
9 | 78180777262234 |
10 | 20112111112000 |
11 | 6454553445906 |
12 | 2309a41399994 |
13 | b2b743c8c52b |
14 | 4d7607980bcc |
15 | 24d26748d2ba |
hex | 124ab73d0f40 |
20112111112000 has 56 divisors (see below), whose sum is σ = 49807643188680. Its totient is φ = 8044844441600.
The previous prime is 20112111111979. The next prime is 20112111112007. The reversal of 20112111112000 is 21111121102.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2143600522816 + 17968510589184 = 1464104^2 + 4238928^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112111112007) 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, 1256998945 + ... + 1257014944.
Almost surely, 220112111112000 is an apocalyptic number.
20112111112000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20112111112000 is an abundant number, since it is smaller than the sum of its proper divisors (29695532076680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112111112000 is an equidigital number, since it uses as much as digits as its factorization.
20112111112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2514013916 (or 2514013896 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20112111112000 its reverse (21111121102), we get a palindrome (20133222233102).
The spelling of 20112111112000 in words is "twenty trillion, one hundred twelve billion, one hundred eleven million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •