Base | Representation |
---|---|
bin | 10000001001110111101… |
… | …101100101101110110101 |
3 | 10221010101110211002101000 |
4 | 100021313231211232311 |
5 | 121142001130031401 |
6 | 2205551045553513 |
7 | 143126363220222 |
oct | 20116755455665 |
9 | 3833343732330 |
10 | 1110110002101 |
11 | 398882179231 |
12 | 15b191715899 |
13 | 808b54cba39 |
14 | 3ba300a2949 |
15 | 1dd2333c186 |
hex | 10277b65bb5 |
1110110002101 has 8 divisors (see below), whose sum is σ = 1644607410560. Its totient is φ = 740073334716.
The previous prime is 1110110002031. The next prime is 1110110002121. The reversal of 1110110002101 is 1012000110111.
It is not a de Polignac number, because 1110110002101 - 211 = 1110110000053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110110002121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20557592605 + ... + 20557592658.
It is an arithmetic number, because the mean of its divisors is an integer number (205575926320).
Almost surely, 21110110002101 is an apocalyptic number.
It is an amenable number.
1110110002101 is a deficient number, since it is larger than the sum of its proper divisors (534497408459).
1110110002101 is an equidigital number, since it uses as much as digits as its factorization.
1110110002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41115185272 (or 41115185266 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1110110002101 its reverse (1012000110111), we get a palindrome (2122110112212).
The spelling of 1110110002101 in words is "one trillion, one hundred ten billion, one hundred ten million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •