Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …010001111111100000101111 |
3 | 112200120002120122111010121110 |
4 | 121131310020101333200233 |
5 | 104140002000241041421 |
6 | 1034112031252403103 |
7 | 32406506302466130 |
oct | 3135641021774057 |
9 | 480502518433543 |
10 | 112000001112111 |
11 | 32760a2a880582 |
12 | 1068a425916493 |
13 | 4a65729b34a88 |
14 | 1d92b869ddc87 |
15 | ce359c85ea76 |
hex | 65dd0847f82f |
112000001112111 has 64 divisors (see below), whose sum is σ = 177880459108352. Its totient is φ = 61337710080000.
The previous prime is 112000001112091. The next prime is 112000001112133. The reversal of 112000001112111 is 111211100000211.
It is not a de Polignac number, because 112000001112111 - 223 = 111999992723503 is a prime.
It is a super-2 number, since 2×1120000011121112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112000001112191) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26425251 + ... + 30369291.
It is an arithmetic number, because the mean of its divisors is an integer number (2779382173568).
Almost surely, 2112000001112111 is an apocalyptic number.
112000001112111 is a deficient number, since it is larger than the sum of its proper divisors (65880457996241).
112000001112111 is a wasteful number, since it uses less digits than its factorization.
112000001112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3944504.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 112000001112111 its reverse (111211100000211), we get a palindrome (223211101112322).
The spelling of 112000001112111 in words is "one hundred twelve trillion, one million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •