Base | Representation |
---|---|
bin | 1001100011110010101010… |
… | …01111101001011111110000 |
3 | 2202102120212122022011021212 |
4 | 10301321111033221133300 |
5 | 10223402002012041422 |
6 | 112412525241535252 |
7 | 4266500656543400 |
oct | 461712517513760 |
9 | 82376778264255 |
10 | 21021000112112 |
11 | 6774a57601a90 |
12 | 24360164a4528 |
13 | b9636c203400 |
14 | 5295c9726800 |
15 | 266c1006c9e2 |
hex | 131e553e97f0 |
21021000112112 has 180 divisors, whose sum is σ = 55966331101896. Its totient is φ = 7559999516160.
The previous prime is 21021000112067. The next prime is 21021000112117. The reversal of 21021000112112 is 21121100012012.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21021000112117) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 5754083 + ... + 8668994.
Almost surely, 221021000112112 is an apocalyptic number.
21021000112112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21021000112112 is an abundant number, since it is smaller than the sum of its proper divisors (34945330989784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21021000112112 is a wasteful number, since it uses less digits than its factorization.
21021000112112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14423136 (or 14423110 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21021000112112 its reverse (21121100012012), we get a palindrome (42142100124124).
It can be divided in two parts, 21021000 and 112112, that added together give a palindrome (21133112).
The spelling of 21021000112112 in words is "twenty-one trillion, twenty-one billion, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •