Base | Representation |
---|---|
bin | 1001101001010011000110… |
… | …01001110001000010110011 |
3 | 2210002200021010212120211200 |
4 | 10310221203021301002303 |
5 | 10240002003233342321 |
6 | 113035500433342243 |
7 | 4316246553264165 |
oct | 464514311610263 |
9 | 83080233776750 |
10 | 21210212012211 |
11 | 6838222806042 |
12 | 2466821107983 |
13 | bab16448a901 |
14 | 534818b36935 |
15 | 26bad635cd26 |
hex | 134a632710b3 |
21210212012211 has 12 divisors (see below), whose sum is σ = 31464999201792. Its totient is φ = 13757975359056.
The previous prime is 21210212012201. The next prime is 21210212012293. The reversal of 21210212012211 is 11221021201212.
21210212012211 is a `hidden beast` number, since 21 + 210 + 21 + 201 + 2 + 211 = 666.
It is not a de Polignac number, because 21210212012211 - 26 = 21210212012147 is a prime.
It is a super-2 number, since 2×212102120122112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21210212012201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31847164851 + ... + 31847165516.
It is an arithmetic number, because the mean of its divisors is an integer number (2622083266816).
Almost surely, 221210212012211 is an apocalyptic number.
21210212012211 is a deficient number, since it is larger than the sum of its proper divisors (10254787189581).
21210212012211 is a wasteful number, since it uses less digits than its factorization.
21210212012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63694330410 (or 63694330407 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21210212012211 its reverse (11221021201212), we get a palindrome (32431233213423).
The spelling of 21210212012211 in words is "twenty-one trillion, two hundred ten billion, two hundred twelve million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •