Base | Representation |
---|---|
bin | 11101011011011000001… |
… | …11001000110100100111 |
3 | 10120122220110121011110002 |
4 | 32231230013020310213 |
5 | 113031244032000111 |
6 | 2052301321051515 |
7 | 133023525516416 |
oct | 16555407106447 |
9 | 3518813534402 |
10 | 1011131125031 |
11 | 35a900183985 |
12 | 143b69926b9b |
13 | 74470413a61 |
14 | 36d208cb47d |
15 | 1b47daa763b |
hex | eb6c1c8d27 |
1011131125031 has 2 divisors, whose sum is σ = 1011131125032. Its totient is φ = 1011131125030.
The previous prime is 1011131124947. The next prime is 1011131125033. The reversal of 1011131125031 is 1305211311101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1011131125031 - 222 = 1011126930727 is a prime.
It is a super-2 number, since 2×10111311250312 (a number of 25 digits) contains 22 as substring.
Together with 1011131125033, 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 = 1011131124994 and 1011131125012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011131125033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505565562515 + 505565562516.
It is an arithmetic number, because the mean of its divisors is an integer number (505565562516).
Almost surely, 21011131125031 is an apocalyptic number.
1011131125031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011131125031 is an equidigital number, since it uses as much as digits as its factorization.
1011131125031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 20.
Adding to 1011131125031 its reverse (1305211311101), we get a palindrome (2316342436132).
The spelling of 1011131125031 in words is "one trillion, eleven billion, one hundred thirty-one million, one hundred twenty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •