Base | Representation |
---|---|
bin | 110100001001110111… |
… | …0110110110110101111 |
3 | 101201002111010200002200 |
4 | 1220103232312312233 |
5 | 3313334022400421 |
6 | 123241400552543 |
7 | 11043316664442 |
oct | 1502356666657 |
9 | 351074120080 |
10 | 112000200111 |
11 | 43554214058 |
12 | 19858782753 |
13 | a73ba14377 |
14 | 55c6ad1659 |
15 | 2da79e9726 |
hex | 1a13bb6daf |
112000200111 has 12 divisors (see below), whose sum is σ = 166996714560. Its totient is φ = 72258193440.
The previous prime is 112000200061. The next prime is 112000200157. The reversal of 112000200111 is 111002000211.
It is a happy number.
It is not a de Polignac number, because 112000200111 - 215 = 112000167343 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 112000200093 and 112000200102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112000200211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 200716926 + ... + 200717483.
It is an arithmetic number, because the mean of its divisors is an integer number (13916392880).
Almost surely, 2112000200111 is an apocalyptic number.
112000200111 is a deficient number, since it is larger than the sum of its proper divisors (54996514449).
112000200111 is a wasteful number, since it uses less digits than its factorization.
112000200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401434446 (or 401434443 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112000200111 its reverse (111002000211), we get a palindrome (223002200322).
The spelling of 112000200111 in words is "one hundred twelve billion, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •