Base | Representation |
---|---|
bin | 11001011111011010100110… |
… | …000010011010100011111011 |
3 | 112200221121120012012220001022 |
4 | 121133122212002122203323 |
5 | 104143302311113324011 |
6 | 1034234344430213055 |
7 | 32420452566631514 |
oct | 3137324602324373 |
9 | 480847505186038 |
10 | 112110022011131 |
11 | 327a36587a5401 |
12 | 106a780b65418b |
13 | 4a72c1176b361 |
14 | 1d982228a3a0b |
15 | ce638b6d48db |
hex | 65f6a609a8fb |
112110022011131 has 2 divisors, whose sum is σ = 112110022011132. Its totient is φ = 112110022011130.
The previous prime is 112110022010881. The next prime is 112110022011137. The reversal of 112110022011131 is 131110220011211.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112110022011131 is a prime.
It is a super-2 number, since 2×1121100220111312 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (112110022011137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56055011005565 + 56055011005566.
It is an arithmetic number, because the mean of its divisors is an integer number (56055011005566).
Almost surely, 2112110022011131 is an apocalyptic number.
112110022011131 is a deficient number, since it is larger than the sum of its proper divisors (1).
112110022011131 is an equidigital number, since it uses as much as digits as its factorization.
112110022011131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 112110022011131 its reverse (131110220011211), we get a palindrome (243220242022342).
The spelling of 112110022011131 in words is "one hundred twelve trillion, one hundred ten billion, twenty-two million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •