Base | Representation |
---|---|
bin | 110011001110011100… |
… | …0000000101100011101 |
3 | 101111221111220110002121 |
4 | 1212130320000230131 |
5 | 3300243031023010 |
6 | 122311444422541 |
7 | 10643024341540 |
oct | 1463470005435 |
9 | 344844813077 |
10 | 110006111005 |
11 | 4272064442a |
12 | 193a09a7a51 |
13 | a4b185959b |
14 | 5477d34857 |
15 | 2cdc9033da |
hex | 199ce00b1d |
110006111005 has 8 divisors (see below), whose sum is σ = 150865523712. Its totient is φ = 75432761808.
The previous prime is 110006110979. The next prime is 110006111027. The reversal of 110006111005 is 500111600011.
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 110006111005 - 29 = 110006110493 is a prime.
It is a super-2 number, since 2×1100061110052 (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 110006111005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1571515837 + ... + 1571515906.
It is an arithmetic number, because the mean of its divisors is an integer number (18858190464).
Almost surely, 2110006111005 is an apocalyptic number.
It is an amenable number.
110006111005 is a deficient number, since it is larger than the sum of its proper divisors (40859412707).
110006111005 is an equidigital number, since it uses as much as digits as its factorization.
110006111005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3143031755.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 110006111005 its reverse (500111600011), we get a palindrome (610117711016).
The spelling of 110006111005 in words is "one hundred ten billion, six million, one hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •