Base | Representation |
---|---|
bin | 1001010010111101000000… |
… | …1100011100111001011011 |
3 | 1100012010202101220211120202 |
4 | 2110233100030130321123 |
5 | 2314431024322402303 |
6 | 33423321432012415 |
7 | 2103313235351636 |
oct | 224572014347133 |
9 | 40163671824522 |
10 | 10221220122203 |
11 | 32908823240a2 |
12 | 1190b35b3110b |
13 | 591b1a87070c |
14 | 2749d1582c1d |
15 | 12ad262e5c88 |
hex | 94bd031ce5b |
10221220122203 has 2 divisors, whose sum is σ = 10221220122204. Its totient is φ = 10221220122202.
The previous prime is 10221220122097. The next prime is 10221220122229. The reversal of 10221220122203 is 30222102212201.
10221220122203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (30222102212201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10221220122203 - 28 = 10221220121947 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (10221220122233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110610061101 + 5110610061102.
It is an arithmetic number, because the mean of its divisors is an integer number (5110610061102).
Almost surely, 210221220122203 is an apocalyptic number.
10221220122203 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221220122203 is an equidigital number, since it uses as much as digits as its factorization.
10221220122203 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10221220122203 its reverse (30222102212201), we get a palindrome (40443322334404).
The spelling of 10221220122203 in words is "ten trillion, two hundred twenty-one billion, two hundred twenty million, one hundred twenty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •