Base | Representation |
---|---|
bin | 1011101100110010100… |
… | …1110100111000110101 |
3 | 201012211011202011211212 |
4 | 2323030221310320311 |
5 | 11243123003342323 |
6 | 232201122411205 |
7 | 20344005625262 |
oct | 2731451647065 |
9 | 635734664755 |
10 | 201002012213 |
11 | 78276439872 |
12 | 32b57200b05 |
13 | 15c53ab2202 |
14 | 9a2b1d4269 |
15 | 5366401b78 |
hex | 2ecca74e35 |
201002012213 has 2 divisors, whose sum is σ = 201002012214. Its totient is φ = 201002012212.
The previous prime is 201002012207. The next prime is 201002012227. The reversal of 201002012213 is 312210200102.
It is a happy number.
It is an a-pointer prime, because the next prime (201002012227) can be obtained adding 201002012213 to its sum of digits (14).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117123426289 + 83878585924 = 342233^2 + 289618^2 .
It is a cyclic number.
It is not a de Polignac number, because 201002012213 - 28 = 201002011957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201002012203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100501006106 + 100501006107.
It is an arithmetic number, because the mean of its divisors is an integer number (100501006107).
Almost surely, 2201002012213 is an apocalyptic number.
It is an amenable number.
201002012213 is a deficient number, since it is larger than the sum of its proper divisors (1).
201002012213 is an equidigital number, since it uses as much as digits as its factorization.
201002012213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 201002012213 its reverse (312210200102), we get a palindrome (513212212315).
The spelling of 201002012213 in words is "two hundred one billion, two million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •