Base | Representation |
---|---|
bin | 1001101001010011000101… |
… | …01000100110111101000001 |
3 | 2210002200020112111222112201 |
4 | 10310221202220212331001 |
5 | 10240001444022221004 |
6 | 113035455523153201 |
7 | 4316246416352635 |
oct | 464514250467501 |
9 | 83080215458481 |
10 | 21210203320129 |
11 | 68382189095aa |
12 | 246681a215801 |
13 | bab162736475 |
14 | 534817912dc5 |
15 | 26bad56e26a4 |
hex | 134a62a26f41 |
21210203320129 has 2 divisors, whose sum is σ = 21210203320130. Its totient is φ = 21210203320128.
The previous prime is 21210203320073. The next prime is 21210203320183. The reversal of 21210203320129 is 92102330201212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19014614330625 + 2195588989504 = 4360575^2 + 1481752^2 .
It is a cyclic number.
It is not a de Polignac number, because 21210203320129 - 231 = 21208055836481 is a prime.
It is a super-2 number, since 2×212102033201292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21210203320097 and 21210203320106.
It is not a weakly prime, because it can be changed into another prime (21210203320429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10605101660064 + 10605101660065.
It is an arithmetic number, because the mean of its divisors is an integer number (10605101660065).
Almost surely, 221210203320129 is an apocalyptic number.
It is an amenable number.
21210203320129 is a deficient number, since it is larger than the sum of its proper divisors (1).
21210203320129 is an equidigital number, since it uses as much as digits as its factorization.
21210203320129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 21210203320129 in words is "twenty-one trillion, two hundred ten billion, two hundred three million, three hundred twenty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •