Base | Representation |
---|---|
bin | 10011110000010101… |
… | …011001011101001000 |
3 | 2000202022010202211120 |
4 | 103300111121131020 |
5 | 321420233312222 |
6 | 13424502555240 |
7 | 1350440053443 |
oct | 236025313510 |
9 | 60668122746 |
10 | 21212010312 |
11 | 8aa5699339 |
12 | 413ba38b20 |
13 | 20008159bc |
14 | 105326065a |
15 | 84237a15c |
hex | 4f0559748 |
21212010312 has 64 divisors (see below), whose sum is σ = 54502761600. Its totient is φ = 6874583040.
The previous prime is 21212010311. The next prime is 21212010317. The reversal of 21212010312 is 21301021212.
It is a junction number, because it is equal to n+sod(n) for n = 21212010291 and 21212010300.
It is not an unprimeable number, because it can be changed into a prime (21212010311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1333864 + ... + 1349672.
It is an arithmetic number, because the mean of its divisors is an integer number (851605650).
Almost surely, 221212010312 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 21212010312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27251380800).
21212010312 is an abundant number, since it is smaller than the sum of its proper divisors (33290751288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21212010312 is a wasteful number, since it uses less digits than its factorization.
21212010312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17366 (or 17362 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 21212010312 its reverse (21301021212), we get a palindrome (42513031524).
The spelling of 21212010312 in words is "twenty-one billion, two hundred twelve million, ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •