Base | Representation |
---|---|
bin | 1001100011001101100110… |
… | …01111001001000101111101 |
3 | 2202100200111220212112221221 |
4 | 10301212303033021011331 |
5 | 10223040224130414323 |
6 | 112355435000353341 |
7 | 4265164614232351 |
oct | 461466317110575 |
9 | 82320456775857 |
10 | 21001102201213 |
11 | 6767576771022 |
12 | 24321a2775851 |
13 | b9451aa21134 |
14 | 52865cc17461 |
15 | 26644826a55d |
hex | 1319b33c917d |
21001102201213 has 2 divisors, whose sum is σ = 21001102201214. Its totient is φ = 21001102201212.
The previous prime is 21001102201147. The next prime is 21001102201231. The reversal of 21001102201213 is 31210220110012.
Together with next prime (21001102201231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20977517534884 + 23584666329 = 4580122^2 + 153573^2 .
It is a cyclic number.
It is not a de Polignac number, because 21001102201213 - 217 = 21001102070141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21001102201243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10500551100606 + 10500551100607.
It is an arithmetic number, because the mean of its divisors is an integer number (10500551100607).
Almost surely, 221001102201213 is an apocalyptic number.
It is an amenable number.
21001102201213 is a deficient number, since it is larger than the sum of its proper divisors (1).
21001102201213 is an equidigital number, since it uses as much as digits as its factorization.
21001102201213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 21001102201213 its reverse (31210220110012), we get a palindrome (52211322311225).
The spelling of 21001102201213 in words is "twenty-one trillion, one billion, one hundred two million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •