Base | Representation |
---|---|
bin | 10011101111101000… |
… | …010110000110110000 |
3 | 2000201110220202021202 |
4 | 103233220112012300 |
5 | 321404222400422 |
6 | 13423401510332 |
7 | 1350234504410 |
oct | 235750260660 |
9 | 60643822252 |
10 | 21200200112 |
11 | 8a99a62143 |
12 | 4137aa23a8 |
13 | 1ccb23c210 |
14 | 1051868640 |
15 | 8412e5b92 |
hex | 4efa161b0 |
21200200112 has 80 divisors (see below), whose sum is σ = 50735211072. Its totient is φ = 8356884480.
The previous prime is 21200200111. The next prime is 21200200139. The reversal of 21200200112 is 21100200212.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 21200200093 and 21200200102.
It is not an unprimeable number, because it can be changed into a prime (21200200111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 383228 + ... + 435044.
Almost surely, 221200200112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21200200112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25367605536).
21200200112 is an abundant number, since it is smaller than the sum of its proper divisors (29535010960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21200200112 is a wasteful number, since it uses less digits than its factorization.
21200200112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52126 (or 52120 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 21200200112 its reverse (21100200212), we get a palindrome (42300400324).
The spelling of 21200200112 in words is "twenty-one billion, two hundred million, two hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •