Base | Representation |
---|---|
bin | 1001001011111101111110… |
… | …1100111001000010001101 |
3 | 1022202200000110202222120012 |
4 | 2102333133230321002031 |
5 | 2310444300111400023 |
6 | 33252234214403005 |
7 | 2061534451345556 |
oct | 222773754710215 |
9 | 38680013688505 |
10 | 10101221200013 |
11 | 32449a4035829 |
12 | 1171826660465 |
13 | 583705972b08 |
14 | 26cc8a43b32d |
15 | 127b514a4978 |
hex | 92fdfb3908d |
10101221200013 has 2 divisors, whose sum is σ = 10101221200014. Its totient is φ = 10101221200012.
The previous prime is 10101221199917. The next prime is 10101221200039. The reversal of 10101221200013 is 31000212210101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8096881632004 + 2004339568009 = 2845502^2 + 1415747^2 .
It is an emirp because it is prime and its reverse (31000212210101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10101221200013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101221200313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050610600006 + 5050610600007.
It is an arithmetic number, because the mean of its divisors is an integer number (5050610600007).
Almost surely, 210101221200013 is an apocalyptic number.
It is an amenable number.
10101221200013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101221200013 is an equidigital number, since it uses as much as digits as its factorization.
10101221200013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10101221200013 its reverse (31000212210101), we get a palindrome (41101433410114).
The spelling of 10101221200013 in words is "ten trillion, one hundred one billion, two hundred twenty-one million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •