Base | Representation |
---|---|
bin | 101111110010110101110111… |
… | …101010010101101010001001 |
3 | 1000120021010002221022012102011 |
4 | 233302311313222111222021 |
5 | 210022422200004133001 |
6 | 2023021244442535521 |
7 | 62163410364556054 |
oct | 5762656752255211 |
9 | 1016233087265364 |
10 | 210202002021001 |
11 | 60a82194205581 |
12 | 1b6aa6812075a1 |
13 | 9039c6b43a783 |
14 | 39c9b8ca97a9b |
15 | 1947c830b7d51 |
hex | bf2d77a95a89 |
210202002021001 has 2 divisors, whose sum is σ = 210202002021002. Its totient is φ = 210202002021000.
The previous prime is 210202002020999. The next prime is 210202002021013. The reversal of 210202002021001 is 100120200202012.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116389682444025 + 93812319576976 = 10788405^2 + 9685676^2 .
It is a cyclic number.
It is not a de Polignac number, because 210202002021001 - 21 = 210202002020999 is a prime.
Together with 210202002020999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (210202002021101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105101001010500 + 105101001010501.
It is an arithmetic number, because the mean of its divisors is an integer number (105101001010501).
Almost surely, 2210202002021001 is an apocalyptic number.
It is an amenable number.
210202002021001 is a deficient number, since it is larger than the sum of its proper divisors (1).
210202002021001 is an equidigital number, since it uses as much as digits as its factorization.
210202002021001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 210202002021001 its reverse (100120200202012), we get a palindrome (310322202223013).
The spelling of 210202002021001 in words is "two hundred ten trillion, two hundred two billion, two million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •