Base | Representation |
---|---|
bin | 11001011111100011111111… |
… | …011001010011111101010011 |
3 | 112200222120121022122201211222 |
4 | 121133203333121103331103 |
5 | 104143433441421321321 |
6 | 1034243133514555255 |
7 | 32421260605635635 |
oct | 3137437731237523 |
9 | 480876538581758 |
10 | 112120111120211 |
11 | 327a7965842387 |
12 | 106a9766438b2b |
13 | 4a73b5ba5809c |
14 | 1d988dc7c0a55 |
15 | ce677c2e53ab |
hex | 65f8ff653f53 |
112120111120211 has 2 divisors, whose sum is σ = 112120111120212. Its totient is φ = 112120111120210.
The previous prime is 112120111120187. The next prime is 112120111120271. The reversal of 112120111120211 is 112021111021211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112120111120211 - 234 = 112102931251027 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112120111120211.
It is not a weakly prime, because it can be changed into another prime (112120111120271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56060055560105 + 56060055560106.
It is an arithmetic number, because the mean of its divisors is an integer number (56060055560106).
Almost surely, 2112120111120211 is an apocalyptic number.
112120111120211 is a deficient number, since it is larger than the sum of its proper divisors (1).
112120111120211 is an equidigital number, since it uses as much as digits as its factorization.
112120111120211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 112120111120211 its reverse (112021111021211), we get a palindrome (224141222141422).
The spelling of 112120111120211 in words is "one hundred twelve trillion, one hundred twenty billion, one hundred eleven million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •