Base | Representation |
---|---|
bin | 1001100011001011101111… |
… | …01000001011011000001101 |
3 | 2202100120221020001201211022 |
4 | 10301211313220023120031 |
5 | 10223031202121144323 |
6 | 112355151433403525 |
7 | 4265131051620362 |
oct | 461456750133015 |
9 | 82316836051738 |
10 | 21000102131213 |
11 | 67671031aa697 |
12 | 2431b638695a5 |
13 | b943bb78b13a |
14 | 5285a608c469 |
15 | 2663da5734c8 |
hex | 131977a0b60d |
21000102131213 has 2 divisors, whose sum is σ = 21000102131214. Its totient is φ = 21000102131212.
The previous prime is 21000102131207. The next prime is 21000102131249. The reversal of 21000102131213 is 31213120100012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20575178064169 + 424924067044 = 4535987^2 + 651862^2 .
It is a cyclic number.
It is not a de Polignac number, because 21000102131213 - 224 = 21000085353997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21000102131191 and 21000102131200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21000102131513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10500051065606 + 10500051065607.
It is an arithmetic number, because the mean of its divisors is an integer number (10500051065607).
Almost surely, 221000102131213 is an apocalyptic number.
It is an amenable number.
21000102131213 is a deficient number, since it is larger than the sum of its proper divisors (1).
21000102131213 is an equidigital number, since it uses as much as digits as its factorization.
21000102131213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 21000102131213 its reverse (31213120100012), we get a palindrome (52213222231225).
The spelling of 21000102131213 in words is "twenty-one trillion, one hundred two million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •