Base | Representation |
---|---|
bin | 1001100011110001001100… |
… | …01010011010010100110101 |
3 | 2202102111211120221222102211 |
4 | 10301320212022122110311 |
5 | 10223343342303210401 |
6 | 112412315023333421 |
7 | 4266442255515154 |
oct | 461704612322465 |
9 | 82374746858384 |
10 | 21020210210101 |
11 | 6774691738a03 |
12 | 2435a35a51271 |
13 | b9627467787b |
14 | 52955286959b |
15 | 266bb5a3c951 |
hex | 131e2629a535 |
21020210210101 has 2 divisors, whose sum is σ = 21020210210102. Its totient is φ = 21020210210100.
The previous prime is 21020210210011. The next prime is 21020210210117. The reversal of 21020210210101 is 10101201202012.
Together with previous prime (21020210210011) 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., 12692795663025 + 8327414547076 = 3562695^2 + 2885726^2 .
It is a cyclic number.
It is not a de Polignac number, because 21020210210101 - 213 = 21020210201909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21020210210191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10510105105050 + 10510105105051.
It is an arithmetic number, because the mean of its divisors is an integer number (10510105105051).
Almost surely, 221020210210101 is an apocalyptic number.
It is an amenable number.
21020210210101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21020210210101 is an equidigital number, since it uses as much as digits as its factorization.
21020210210101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21020210210101 its reverse (10101201202012), we get a palindrome (31121411412113).
The spelling of 21020210210101 in words is "twenty-one trillion, twenty billion, two hundred ten million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •