Base | Representation |
---|---|
bin | 1001100011110001001100… |
… | …01001101011111100100001 |
3 | 2202102111211120121022211211 |
4 | 10301320212021223330201 |
5 | 10223343342231121004 |
6 | 112412315015310121 |
7 | 4266442254064255 |
oct | 461704611537441 |
9 | 82374746538754 |
10 | 21020210020129 |
11 | 6774691619201 |
12 | 2435a3597b341 |
13 | b9627460c268 |
14 | 52955281a265 |
15 | 266bb5a01504 |
hex | 131e2626bf21 |
21020210020129 has 2 divisors, whose sum is σ = 21020210020130. Its totient is φ = 21020210020128.
The previous prime is 21020210020087. The next prime is 21020210020151. The reversal of 21020210020129 is 92102001202012.
It is an a-pointer prime, because the next prime (21020210020151) can be obtained adding 21020210020129 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13193951993104 + 7826258027025 = 3632348^2 + 2797545^2 .
It is a cyclic number.
It is not a de Polignac number, because 21020210020129 - 221 = 21020207922977 is a prime.
It is a super-2 number, since 2×210202100201292 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21020210026129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10510105010064 + 10510105010065.
It is an arithmetic number, because the mean of its divisors is an integer number (10510105010065).
Almost surely, 221020210020129 is an apocalyptic number.
It is an amenable number.
21020210020129 is a deficient number, since it is larger than the sum of its proper divisors (1).
21020210020129 is an equidigital number, since it uses as much as digits as its factorization.
21020210020129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 21020210020129 in words is "twenty-one trillion, twenty billion, two hundred ten million, twenty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •