Base | Representation |
---|---|
bin | 110100001001111011… |
… | …0000110111101110111 |
3 | 101201002121201020210002 |
4 | 1220103312012331313 |
5 | 3313340014213421 |
6 | 123241505421515 |
7 | 11043342102635 |
oct | 1502366067567 |
9 | 351077636702 |
10 | 112002101111 |
11 | 435552a232a |
12 | 1985933a89b |
13 | a73c22b714 |
14 | 55c7068355 |
15 | 2da7c72b0b |
hex | 1a13d86f77 |
112002101111 has 4 divisors (see below), whose sum is σ = 112216254792. Its totient is φ = 111787947432.
The previous prime is 112002101089. The next prime is 112002101149. The reversal of 112002101111 is 111101200211.
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 112002101111 - 26 = 112002101047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112002101092 and 112002101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112002109111) 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, 107076056 + ... + 107077101.
It is an arithmetic number, because the mean of its divisors is an integer number (28054063698).
Almost surely, 2112002101111 is an apocalyptic number.
112002101111 is a deficient number, since it is larger than the sum of its proper divisors (214153681).
112002101111 is an equidigital number, since it uses as much as digits as its factorization.
112002101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214153680.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112002101111 its reverse (111101200211), we get a palindrome (223103301322).
The spelling of 112002101111 in words is "one hundred twelve billion, two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •