Base | Representation |
---|---|
bin | 110100001010011111… |
… | …0100101111000011111 |
3 | 101201010221110121020211 |
4 | 1220110332211320133 |
5 | 3313404400231421 |
6 | 123243424553251 |
7 | 11043662441302 |
oct | 1502476457037 |
9 | 351127417224 |
10 | 112021102111 |
11 | 43564aa0036 |
12 | 19863782827 |
13 | a743152209 |
14 | 55c97b2b39 |
15 | 2da97779e1 |
hex | 1a14fa5e1f |
112021102111 has 4 divisors (see below), whose sum is σ = 112026875400. Its totient is φ = 112015328824.
The previous prime is 112021102103. The next prime is 112021102117. The reversal of 112021102111 is 111201120211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111201120211 = 194093 ⋅572927.
It is a cyclic number.
It is not a de Polignac number, because 112021102111 - 23 = 112021102103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112021102091 and 112021102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112021102117) 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, 2857441 + ... + 2896378.
It is an arithmetic number, because the mean of its divisors is an integer number (28006718850).
Almost surely, 2112021102111 is an apocalyptic number.
112021102111 is a deficient number, since it is larger than the sum of its proper divisors (5773289).
112021102111 is an equidigital number, since it uses as much as digits as its factorization.
112021102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5773288.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112021102111 its reverse (111201120211), we get a palindrome (223222222322).
The spelling of 112021102111 in words is "one hundred twelve billion, twenty-one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •