Base | Representation |
---|---|
bin | 1001010010111100100100… |
… | …0010100110110110010101 |
3 | 1100012010110001002010110111 |
4 | 2110233021002212312111 |
5 | 2314430303111213023 |
6 | 33423301503323021 |
7 | 2103310250241634 |
oct | 224571102466625 |
9 | 40163401063414 |
10 | 10221100101013 |
11 | 32908205a842a |
12 | 1190b018b0471 |
13 | 591acba39c69 |
14 | 2749bd65d51b |
15 | 12ad1a9d900d |
hex | 94bc90a6d95 |
10221100101013 has 2 divisors, whose sum is σ = 10221100101014. Its totient is φ = 10221100101012.
The previous prime is 10221100100993. The next prime is 10221100101061. The reversal of 10221100101013 is 31010100112201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10035254615409 + 185845485604 = 3167847^2 + 431098^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221100101013 - 233 = 10212510166421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221100100984 and 10221100101002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221100101083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110550050506 + 5110550050507.
It is an arithmetic number, because the mean of its divisors is an integer number (5110550050507).
Almost surely, 210221100101013 is an apocalyptic number.
It is an amenable number.
10221100101013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221100101013 is an equidigital number, since it uses as much as digits as its factorization.
10221100101013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10221100101013 its reverse (31010100112201), we get a palindrome (41231200213214).
The spelling of 10221100101013 in words is "ten trillion, two hundred twenty-one billion, one hundred million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •