Base | Representation |
---|---|
bin | 11001100001000001000111… |
… | …110111011010110110001111 |
3 | 112201100010201111111011010200 |
4 | 121201001013313122312033 |
5 | 104202103241433020421 |
6 | 1034401112444104543 |
7 | 32431430653521456 |
oct | 3141010767326617 |
9 | 481303644434120 |
10 | 112220111220111 |
11 | 32836311236544 |
12 | 10705014235153 |
13 | 4a804075a112b |
14 | 1d9d6a7869b9d |
15 | ce918154e726 |
hex | 661047ddad8f |
112220111220111 has 48 divisors (see below), whose sum is σ = 163528392867840. Its totient is φ = 74153335757760.
The previous prime is 112220111220109. The next prime is 112220111220227. The reversal of 112220111220111 is 111022111022211.
It is a happy number.
112220111220111 is a `hidden beast` number, since 1 + 1 + 2 + 220 + 111 + 220 + 111 = 666.
It is not a de Polignac number, because 112220111220111 - 21 = 112220111220109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112220111220011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5783637736 + ... + 5783657138.
It is an arithmetic number, because the mean of its divisors is an integer number (3406841518080).
Almost surely, 2112220111220111 is an apocalyptic number.
112220111220111 is a deficient number, since it is larger than the sum of its proper divisors (51308281647729).
112220111220111 is a wasteful number, since it uses less digits than its factorization.
112220111220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24116 (or 24113 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 112220111220111 its reverse (111022111022211), we get a palindrome (223242222242322).
The spelling of 112220111220111 in words is "one hundred twelve trillion, two hundred twenty billion, one hundred eleven million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •