Base | Representation |
---|---|
bin | 11100110111111000… |
… | …000000100000101111 |
3 | 2222000121002221110202 |
4 | 130313320000200233 |
5 | 1001443030400421 |
6 | 22124152424115 |
7 | 2145156232031 |
oct | 346770004057 |
9 | 88017087422 |
10 | 31002200111 |
11 | 12169a2a893 |
12 | 60126a803b |
13 | 2c00bc280c |
14 | 17015a9c51 |
15 | c16ae210b |
hex | 737e0082f |
31002200111 has 2 divisors, whose sum is σ = 31002200112. Its totient is φ = 31002200110.
The previous prime is 31002200081. The next prime is 31002200123. The reversal of 31002200111 is 11100220013.
It is a strong prime.
It is an emirp because it is prime and its reverse (11100220013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31002200111 - 222 = 30998005807 is a prime.
It is a super-2 number, since 2×310022001112 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 31002200092 and 31002200101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31002200011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15501100055 + 15501100056.
It is an arithmetic number, because the mean of its divisors is an integer number (15501100056).
Almost surely, 231002200111 is an apocalyptic number.
31002200111 is a deficient number, since it is larger than the sum of its proper divisors (1).
31002200111 is an equidigital number, since it uses as much as digits as its factorization.
31002200111 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 31002200111 its reverse (11100220013), we get a palindrome (42102420124).
The spelling of 31002200111 in words is "thirty-one billion, two million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •