Base | Representation |
---|---|
bin | 110100001111110100… |
… | …1000010011001010110 |
3 | 101201121102002121112200 |
4 | 1220133221002121112 |
5 | 3314241200013420 |
6 | 123313255225330 |
7 | 11051264162601 |
oct | 1503751023126 |
9 | 351542077480 |
10 | 112200001110 |
11 | 43646a8054a |
12 | 198b3678246 |
13 | a77122bc02 |
14 | 5605461338 |
15 | 2dba314b90 |
hex | 1a1fa42656 |
112200001110 has 24 divisors (see below), whose sum is σ = 291720003120. Its totient is φ = 29920000272.
The previous prime is 112200001061. The next prime is 112200001117. The reversal of 112200001110 is 11100002211.
It is a happy number.
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 = 112200001092 and 112200001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112200001117) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 623333250 + ... + 623333429.
It is an arithmetic number, because the mean of its divisors is an integer number (12155000130).
Almost surely, 2112200001110 is an apocalyptic number.
112200001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112200001110 is an abundant number, since it is smaller than the sum of its proper divisors (179520002010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112200001110 is a wasteful number, since it uses less digits than its factorization.
112200001110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1246666692 (or 1246666689 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112200001110 its reverse (11100002211), we get a palindrome (123300003321).
The spelling of 112200001110 in words is "one hundred twelve billion, two hundred million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •