Base | Representation |
---|---|
bin | 11001010000111001001110… |
… | …100100101110111111001100 |
3 | 112120102012210211200010002122 |
4 | 121100321032210232333030 |
5 | 104030430111240400022 |
6 | 1032152112042112112 |
7 | 32255404653324233 |
oct | 3120711644567714 |
9 | 476365724603078 |
10 | 111112122200012 |
11 | 324494283274aa |
12 | 10566334aab638 |
13 | 49cca9c62863b |
14 | 1d61bd9355b1a |
15 | cca434521742 |
hex | 650e4e92efcc |
111112122200012 has 48 divisors (see below), whose sum is σ = 212613592359168. Its totient is φ = 50580408053760.
The previous prime is 111112122200011. The next prime is 111112122200021. The reversal of 111112122200012 is 210002221211111.
111112122200012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is not an unprimeable number, because it can be changed into a prime (111112122200011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5808923 + ... + 15998994.
It is an arithmetic number, because the mean of its divisors is an integer number (4429449840816).
Almost surely, 2111112122200012 is an apocalyptic number.
It is an amenable number.
111112122200012 is a deficient number, since it is larger than the sum of its proper divisors (101501470159156).
111112122200012 is a wasteful number, since it uses less digits than its factorization.
111112122200012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21810386 (or 21810384 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 111112122200012 its reverse (210002221211111), we get a palindrome (321114343411123).
The spelling of 111112122200012 in words is "one hundred eleven trillion, one hundred twelve billion, one hundred twenty-two million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •