Base | Representation |
---|---|
bin | 11001011111010010011001… |
… | …100001000101000000110011 |
3 | 112200220202211220110120011222 |
4 | 121133102121201011000303 |
5 | 104143131300313322211 |
6 | 1034230331311455255 |
7 | 32420021533104326 |
oct | 3137223141050063 |
9 | 480822756416158 |
10 | 112101222010931 |
11 | 3279a952396a6a |
12 | 106a5b7452752b |
13 | 4a7213b57524a |
14 | 1d97a29c707bd |
15 | ce6023d621db |
hex | 65f499845033 |
112101222010931 has 2 divisors, whose sum is σ = 112101222010932. Its totient is φ = 112101222010930.
The previous prime is 112101222010919. The next prime is 112101222011033. The reversal of 112101222010931 is 139010222101211.
It is a weak prime.
It is an emirp because it is prime and its reverse (139010222101211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112101222010931 is a prime.
It is a super-2 number, since 2×1121012220109312 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112101222010931.
It is not a weakly prime, because it can be changed into another prime (112101222010031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56050611005465 + 56050611005466.
It is an arithmetic number, because the mean of its divisors is an integer number (56050611005466).
Almost surely, 2112101222010931 is an apocalyptic number.
112101222010931 is a deficient number, since it is larger than the sum of its proper divisors (1).
112101222010931 is an equidigital number, since it uses as much as digits as its factorization.
112101222010931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 112101222010931 in words is "one hundred twelve trillion, one hundred one billion, two hundred twenty-two million, ten thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •