Base | Representation |
---|---|
bin | 110011001110111010… |
… | …1000010111110001111 |
3 | 101111222122000100010102 |
4 | 1212131311002332033 |
5 | 3300311130023434 |
6 | 122313215401315 |
7 | 10643310341234 |
oct | 1463565027617 |
9 | 344878010112 |
10 | 110022111119 |
11 | 42729682568 |
12 | 193a622323b |
13 | a4b4c6c1cb |
14 | 547a0db78b |
15 | 2cde01407e |
hex | 199dd42f8f |
110022111119 has 4 divisors (see below), whose sum is σ = 110193753120. Its totient is φ = 109850469120.
The previous prime is 110022111109. The next prime is 110022111131. The reversal of 110022111119 is 911111220011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 911111220011 = 131 ⋅6955047481.
It is a cyclic number.
It is not a de Polignac number, because 110022111119 - 224 = 110005333903 is a prime.
It is a super-2 number, since 2×1100221111192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110022111119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110022111109) 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, 85820039 + ... + 85821320.
It is an arithmetic number, because the mean of its divisors is an integer number (27548438280).
Almost surely, 2110022111119 is an apocalyptic number.
110022111119 is a deficient number, since it is larger than the sum of its proper divisors (171642001).
110022111119 is an equidigital number, since it uses as much as digits as its factorization.
110022111119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171642000.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 110022111119 in words is "one hundred ten billion, twenty-two million, one hundred eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •