Base | Representation |
---|---|
bin | 1001101001010010101101… |
… | …00001011011011000010000 |
3 | 2210002122201101010220012010 |
4 | 10310221112201123120100 |
5 | 10240001040012023440 |
6 | 113035423423502520 |
7 | 4316241401201562 |
oct | 464512641333020 |
9 | 83078641126163 |
10 | 21210000111120 |
11 | 6838124134677 |
12 | 2466782157a40 |
13 | bab12c5c7652 |
14 | 5347d8937332 |
15 | 26bac2952580 |
hex | 134a5685b610 |
21210000111120 has 160 divisors (see below), whose sum is σ = 70336426180608. Its totient is φ = 5268414726144.
The previous prime is 21210000111077. The next prime is 21210000111187. The reversal of 21210000111120 is 2111100001212.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 21210000111096 and 21210000111105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26400784 + ... + 27192303.
Almost surely, 221210000111120 is an apocalyptic number.
21210000111120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21210000111120 is an abundant number, since it is smaller than the sum of its proper divisors (49126426069488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21210000111120 is a wasteful number, since it uses less digits than its factorization.
21210000111120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53593217 (or 53593211 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 21210000111120 its reverse (2111100001212), we get a palindrome (23321100112332).
The spelling of 21210000111120 in words is "twenty-one trillion, two hundred ten billion, one hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •