Base | Representation |
---|---|
bin | 11101011011001001110… |
… | …01000111111110010111 |
3 | 10120122121000200221021101 |
4 | 32231210321013332113 |
5 | 113031022030323111 |
6 | 2052241313130531 |
7 | 133020525205366 |
oct | 16554471077627 |
9 | 3518530627241 |
10 | 1011010011031 |
11 | 35a848881169 |
12 | 143b35259a47 |
13 | 744512b9a77 |
14 | 36d0c7a17dd |
15 | 1b473131bc1 |
hex | eb64e47f97 |
1011010011031 has 2 divisors, whose sum is σ = 1011010011032. Its totient is φ = 1011010011030.
The previous prime is 1011010011001. The next prime is 1011010011049. The reversal of 1011010011031 is 1301100101101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1011010011031 - 29 = 1011010010519 is a prime.
It is a super-2 number, since 2×10110100110312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011010010999 and 1011010011017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011010011001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505505005515 + 505505005516.
It is an arithmetic number, because the mean of its divisors is an integer number (505505005516).
Almost surely, 21011010011031 is an apocalyptic number.
1011010011031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011010011031 is an equidigital number, since it uses as much as digits as its factorization.
1011010011031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 1011010011031 its reverse (1301100101101), we get a palindrome (2312110112132).
The spelling of 1011010011031 in words is "one trillion, eleven billion, ten million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •