Base | Representation |
---|---|
bin | 101111110010110101001000… |
… | …011101011110101111110111 |
3 | 1000120021001001202012112010011 |
4 | 233302311020131132233313 |
5 | 210022414034242334312 |
6 | 2023021034113441051 |
7 | 62163351640540234 |
oct | 5762651035365767 |
9 | 1016231052175104 |
10 | 210201210121207 |
11 | 60a819181a7538 |
12 | 1b6aa49bb70187 |
13 | 9039b73362806 |
14 | 39c9b1583a78b |
15 | 1947c387e0da7 |
hex | bf2d4875ebf7 |
210201210121207 has 2 divisors, whose sum is σ = 210201210121208. Its totient is φ = 210201210121206.
The previous prime is 210201210121171. The next prime is 210201210121261. The reversal of 210201210121207 is 702121012102012.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210201210121207 is a prime.
It is a super-2 number, since 2×2102012101212072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210201210121267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105100605060603 + 105100605060604.
It is an arithmetic number, because the mean of its divisors is an integer number (105100605060604).
Almost surely, 2210201210121207 is an apocalyptic number.
210201210121207 is a deficient number, since it is larger than the sum of its proper divisors (1).
210201210121207 is an equidigital number, since it uses as much as digits as its factorization.
210201210121207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 210201210121207 its reverse (702121012102012), we get a palindrome (912322222223219).
The spelling of 210201210121207 in words is "two hundred ten trillion, two hundred one billion, two hundred ten million, one hundred twenty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •