Base | Representation |
---|---|
bin | 11101011011010101101… |
… | …10101000001110111111 |
3 | 10120122211222212220211102 |
4 | 32231222312220032333 |
5 | 113031223131120111 |
6 | 2052255244443315 |
7 | 133023151235666 |
oct | 16555266501677 |
9 | 3518758786742 |
10 | 1011110020031 |
11 | 35a89a279431 |
12 | 143b6284953b |
13 | 74468c346a7 |
14 | 36d1bb95ddd |
15 | 1b47bcd913b |
hex | eb6ada83bf |
1011110020031 has 2 divisors, whose sum is σ = 1011110020032. Its totient is φ = 1011110020030.
The previous prime is 1011110020021. The next prime is 1011110020133. The reversal of 1011110020031 is 1300200111101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011110020031 is a prime.
It is a super-2 number, since 2×10111100200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011110019994 and 1011110020021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011110020021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505555010015 + 505555010016.
It is an arithmetic number, because the mean of its divisors is an integer number (505555010016).
Almost surely, 21011110020031 is an apocalyptic number.
1011110020031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011110020031 is an equidigital number, since it uses as much as digits as its factorization.
1011110020031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1011110020031 its reverse (1300200111101), we get a palindrome (2311310131132).
The spelling of 1011110020031 in words is "one trillion, eleven billion, one hundred ten million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •