Base | Representation |
---|---|
bin | 10100101101100110… |
… | …11100001111101111 |
3 | 1001200222020122002002 |
4 | 22112303130033233 |
5 | 140233210031111 |
6 | 5035232122515 |
7 | 542364312665 |
oct | 122663341757 |
9 | 31628218062 |
10 | 11120002031 |
11 | 4796a51126 |
12 | 21a409643b |
13 | 1082a52478 |
14 | 776bcac35 |
15 | 45139563b |
hex | 296cdc3ef |
11120002031 has 2 divisors, whose sum is σ = 11120002032. Its totient is φ = 11120002030.
The previous prime is 11120002013. The next prime is 11120002051. The reversal of 11120002031 is 13020002111.
Together with previous prime (11120002013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11120002031 - 226 = 11052893167 is a prime.
It is a super-2 number, since 2×111200020312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120002051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560001015 + 5560001016.
It is an arithmetic number, because the mean of its divisors is an integer number (5560001016).
Almost surely, 211120002031 is an apocalyptic number.
11120002031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120002031 is an equidigital number, since it uses as much as digits as its factorization.
11120002031 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 11120002031 its reverse (13020002111), we get a palindrome (24140004142).
The spelling of 11120002031 in words is "eleven billion, one hundred twenty million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •