Base | Representation |
---|---|
bin | 10000001011101111101… |
… | …000110000001011101111 |
3 | 10221022120200202011202211 |
4 | 100023233220300023233 |
5 | 121210111213000421 |
6 | 2210522442031251 |
7 | 143230264012513 |
oct | 20135750601357 |
9 | 3838520664684 |
10 | 1112122000111 |
11 | 399714970101 |
12 | 15b6534a8527 |
13 | 80b462b71c5 |
14 | 3bb813a2143 |
15 | 1dddecbe9e1 |
hex | 102efa302ef |
1112122000111 has 4 divisors (see below), whose sum is σ = 1177540941312. Its totient is φ = 1046703058912.
The previous prime is 1112122000081. The next prime is 1112122000151. The reversal of 1112122000111 is 1110002212111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1112122000111 - 213 = 1112121991919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112122000091 and 1112122000100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112122000151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32709470575 + ... + 32709470608.
It is an arithmetic number, because the mean of its divisors is an integer number (294385235328).
Almost surely, 21112122000111 is an apocalyptic number.
1112122000111 is a deficient number, since it is larger than the sum of its proper divisors (65418941201).
1112122000111 is an equidigital number, since it uses as much as digits as its factorization.
1112122000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65418941200.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1112122000111 its reverse (1110002212111), we get a palindrome (2222124212222).
The spelling of 1112122000111 in words is "one trillion, one hundred twelve billion, one hundred twenty-two million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •