Base | Representation |
---|---|
bin | 1001010010011011011100… |
… | …1001111100101111011001 |
3 | 1100011021111110222100100111 |
4 | 2110212313021330233121 |
5 | 2314304101241214314 |
6 | 33415231412004321 |
7 | 2102544041423104 |
oct | 224466711745731 |
9 | 40137443870314 |
10 | 10212210101209 |
11 | 3287a79408a56 |
12 | 118b2406006a1 |
13 | 591012cc214c |
14 | 2743b8abd73b |
15 | 12a99a2d9ec4 |
hex | 949b727cbd9 |
10212210101209 has 2 divisors, whose sum is σ = 10212210101210. Its totient is φ = 10212210101208.
The previous prime is 10212210101087. The next prime is 10212210101231. The reversal of 10212210101209 is 90210101221201.
It is an a-pointer prime, because the next prime (10212210101231) can be obtained adding 10212210101209 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., 9913700851609 + 298509249600 = 3148603^2 + 546360^2 .
It is a cyclic number.
It is not a de Polignac number, because 10212210101209 - 243 = 1416117079001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10212210101209.
It is not a weakly prime, because it can be changed into another prime (10212210101239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106105050604 + 5106105050605.
It is an arithmetic number, because the mean of its divisors is an integer number (5106105050605).
Almost surely, 210212210101209 is an apocalyptic number.
It is an amenable number.
10212210101209 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212210101209 is an equidigital number, since it uses as much as digits as its factorization.
10212210101209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 10212210101209 in words is "ten trillion, two hundred twelve billion, two hundred ten million, one hundred one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •