Base | Representation |
---|---|
bin | 1001010010010011100101… |
… | …1101001101001010111111 |
3 | 1100011002001111202002020012 |
4 | 2110210321131031022333 |
5 | 2314240241403020111 |
6 | 33414242235213435 |
7 | 2102440553266346 |
oct | 224447135151277 |
9 | 40132044662205 |
10 | 10210101220031 |
11 | 3287096a64349 |
12 | 118a9522a727b |
13 | 590a68114a6b |
14 | 2742589a0b5d |
15 | 12a8c50bb48b |
hex | 9493974d2bf |
10210101220031 has 2 divisors, whose sum is σ = 10210101220032. Its totient is φ = 10210101220030.
The previous prime is 10210101219947. The next prime is 10210101220057. The reversal of 10210101220031 is 13002210101201.
It is a strong prime.
It is an emirp because it is prime and its reverse (13002210101201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10210101220031 - 234 = 10192921350847 is a prime.
It is a super-2 number, since 2×102101012200312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10210101219988 and 10210101220015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210101222031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105050610015 + 5105050610016.
It is an arithmetic number, because the mean of its divisors is an integer number (5105050610016).
Almost surely, 210210101220031 is an apocalyptic number.
10210101220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210101220031 is an equidigital number, since it uses as much as digits as its factorization.
10210101220031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10210101220031 its reverse (13002210101201), we get a palindrome (23212311321232).
The spelling of 10210101220031 in words is "ten trillion, two hundred ten billion, one hundred one million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •