Base | Representation |
---|---|
bin | 110100001010001100… |
… | …0000110010000100111 |
3 | 101201010020110221000002 |
4 | 1220110120012100213 |
5 | 3313344304323421 |
6 | 123242424411515 |
7 | 11043510612416 |
oct | 1502430062047 |
9 | 351106427002 |
10 | 112011011111 |
11 | 4355a32856a |
12 | 19860316b9b |
13 | a74102b0cc |
14 | 55c830747d |
15 | 2da8932b0b |
hex | 1a14606427 |
112011011111 has 8 divisors (see below), whose sum is σ = 115877260800. Its totient is φ = 108145014880.
The previous prime is 112011011107. The next prime is 112011011117. The reversal of 112011011111 is 111110110211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112011011111 - 22 = 112011011107 is a prime.
It is a super-2 number, since 2×1120110111112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112011011092 and 112011011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112011011117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1443245 + ... + 1518873.
It is an arithmetic number, because the mean of its divisors is an integer number (14484657600).
Almost surely, 2112011011111 is an apocalyptic number.
112011011111 is a deficient number, since it is larger than the sum of its proper divisors (3866249689).
112011011111 is an equidigital number, since it uses as much as digits as its factorization.
112011011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126729.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 112011011111 its reverse (111110110211), we get a palindrome (223121121322).
The spelling of 112011011111 in words is "one hundred twelve billion, eleven million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •