Base | Representation |
---|---|
bin | 110100001001111001… |
… | …0000100111010001111 |
3 | 101201002112201112211221 |
4 | 1220103302010322033 |
5 | 3313334231402421 |
6 | 123241431024211 |
7 | 11043330111205 |
oct | 1502362047217 |
9 | 351075645757 |
10 | 112001044111 |
11 | 43554740180 |
12 | 19858b0b067 |
13 | a73bc4b588 |
14 | 55c6c71075 |
15 | 2da7b14841 |
hex | 1a13c84e8f |
112001044111 has 4 divisors (see below), whose sum is σ = 122182957224. Its totient is φ = 101819131000.
The previous prime is 112001044069. The next prime is 112001044153. The reversal of 112001044111 is 111440100211.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (112001044069) and next prime (112001044153).
It is a cyclic number.
It is not a de Polignac number, because 112001044111 - 29 = 112001043599 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112001044711) 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, 5090956540 + ... + 5090956561.
It is an arithmetic number, because the mean of its divisors is an integer number (30545739306).
Almost surely, 2112001044111 is an apocalyptic number.
112001044111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112001044111 is a deficient number, since it is larger than the sum of its proper divisors (10181913113).
112001044111 is a wasteful number, since it uses less digits than its factorization.
112001044111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10181913112.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112001044111 its reverse (111440100211), we get a palindrome (223441144322).
The spelling of 112001044111 in words is "one hundred twelve billion, one million, forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •