Base | Representation |
---|---|
bin | 1110001001011100111101… |
… | …10001111101000010001111 |
3 | 11002011012012212222122011021 |
4 | 13010232132301331002033 |
5 | 13034211024134120421 |
6 | 150100125245535011 |
7 | 6360463233623644 |
oct | 704563661750217 |
9 | 132135185878137 |
10 | 31111112020111 |
11 | 9a0516a741242 |
12 | 35a5660574467 |
13 | 14489c4403846 |
14 | 797b00563dcb |
15 | 38e411095341 |
hex | 1c4b9ec7d08f |
31111112020111 has 4 divisors (see below), whose sum is σ = 31698114133752. Its totient is φ = 30524109906472.
The previous prime is 31111112019983. The next prime is 31111112020123. The reversal of 31111112020111 is 11102021111113.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31111112020111 - 27 = 31111112019983 is a prime.
It is a super-2 number, since 2×311111120201112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31111112020171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 293501056741 + ... + 293501056846.
It is an arithmetic number, because the mean of its divisors is an integer number (7924528533438).
Almost surely, 231111112020111 is an apocalyptic number.
31111112020111 is a deficient number, since it is larger than the sum of its proper divisors (587002113641).
31111112020111 is an equidigital number, since it uses as much as digits as its factorization.
31111112020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 587002113640.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 31111112020111 its reverse (11102021111113), we get a palindrome (42213133131224).
The spelling of 31111112020111 in words is "thirty-one trillion, one hundred eleven billion, one hundred twelve million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •