Base | Representation |
---|---|
bin | 1001101001010110101000… |
… | …10110010010011101010100 |
3 | 2210002212011111101021021001 |
4 | 10310223110112102131110 |
5 | 10240014400421321322 |
6 | 113040413114033044 |
7 | 4316344613400205 |
oct | 464532426223524 |
9 | 83085144337231 |
10 | 21212111120212 |
11 | 6839007801a91 |
12 | 2467071118784 |
13 | bab3a7a6b45c |
14 | 53495904b5ac |
15 | 26bb97e41827 |
hex | 134ad4592754 |
21212111120212 has 48 divisors (see below), whose sum is σ = 38817348675840. Its totient is φ = 10134972029952.
The previous prime is 21212111120203. The next prime is 21212111120219. The reversal of 21212111120212 is 21202111121212.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 21212111120212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21212111120219) 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, 6028137 + ... + 8874832.
It is an arithmetic number, because the mean of its divisors is an integer number (808694764080).
Almost surely, 221212111120212 is an apocalyptic number.
It is an amenable number.
21212111120212 is a deficient number, since it is larger than the sum of its proper divisors (17605237555628).
21212111120212 is a wasteful number, since it uses less digits than its factorization.
21212111120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14903200 (or 14903198 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 21212111120212 its reverse (21202111121212), we get a palindrome (42414222241424).
It can be divided in two parts, 2121211 and 1120212, that added together give a palindrome (3241423).
The spelling of 21212111120212 in words is "twenty-one trillion, two hundred twelve billion, one hundred eleven million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •