Base | Representation |
---|---|
bin | 1001100110101101000111… |
… | …10010000011011111000000 |
3 | 2202210011020220200001100021 |
4 | 10303112203302003133000 |
5 | 10232022004103031422 |
6 | 112530522244503224 |
7 | 4306643411555320 |
oct | 463264362033700 |
9 | 82704226601307 |
10 | 21121102002112 |
11 | 68034554aa5a2 |
12 | 24514b23aab14 |
13 | ba2932b68998 |
14 | 5303a410b280 |
15 | 26961d1d1dc7 |
hex | 1335a3c837c0 |
21121102002112 has 56 divisors (see below), whose sum is σ = 48019092927840. Its totient is φ = 9029327462400.
The previous prime is 21121102002083. The next prime is 21121102002113. The reversal of 21121102002112 is 21120020112112.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×211211020021122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21121102002113) 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, 58605037 + ... + 58964332.
Almost surely, 221121102002112 is an apocalyptic number.
It is an amenable number.
21121102002112 is an abundant number, since it is smaller than the sum of its proper divisors (26897990925728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21121102002112 is a wasteful number, since it uses less digits than its factorization.
21121102002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117569789 (or 117569779 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21121102002112 its reverse (21120020112112), we get a palindrome (42241122114224).
The spelling of 21121102002112 in words is "twenty-one trillion, one hundred twenty-one billion, one hundred two million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •