Base | Representation |
---|---|
bin | 1001001100011110110000… |
… | …1001101110011100111111 |
3 | 1022210111201200022100112002 |
4 | 2103013230021232130333 |
5 | 2311120310111120111 |
6 | 33300251251532515 |
7 | 2062265502156221 |
oct | 223075411563477 |
9 | 38714650270462 |
10 | 10110020020031 |
11 | 32486a9808508 |
12 | 11734812ba13b |
13 | 5844a88449a9 |
14 | 26d482c44411 |
15 | 127eb8b9263b |
hex | 931ec26e73f |
10110020020031 has 2 divisors, whose sum is σ = 10110020020032. Its totient is φ = 10110020020030.
The previous prime is 10110020019991. The next prime is 10110020020033. The reversal of 10110020020031 is 13002002001101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10110020020031 is a prime.
It is a super-2 number, since 2×101100200200312 (a number of 27 digits) contains 22 as substring.
Together with 10110020020033, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10110020019994 and 10110020020021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110020020033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055010010015 + 5055010010016.
It is an arithmetic number, because the mean of its divisors is an integer number (5055010010016).
Almost surely, 210110020020031 is an apocalyptic number.
10110020020031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110020020031 is an equidigital number, since it uses as much as digits as its factorization.
10110020020031 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 11.
Adding to 10110020020031 its reverse (13002002001101), we get a palindrome (23112022021132).
The spelling of 10110020020031 in words is "ten trillion, one hundred ten billion, twenty million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •