Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …000000111011001101001 |
3 | 10221010010111122111122120 |
4 | 100021301300013121221 |
5 | 121141300030013001 |
6 | 2205533114341453 |
7 | 143124040221636 |
oct | 20116160073151 |
9 | 3833114574576 |
10 | 1110010001001 |
11 | 3988307869a0 |
12 | 15b16412a889 |
13 | 8089a8878a5 |
14 | 3ba20ab118d |
15 | 1dd19687236 |
hex | 10271c07669 |
1110010001001 has 32 divisors (see below), whose sum is σ = 1637922705408. Its totient is φ = 663062715840.
The previous prime is 1110010000969. The next prime is 1110010001011. The reversal of 1110010001001 is 1001000100111.
It is not a de Polignac number, because 1110010001001 - 25 = 1110010000969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1110010001011) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 102265 + ... + 1493478.
It is an arithmetic number, because the mean of its divisors is an integer number (51185084544).
Almost surely, 21110010001001 is an apocalyptic number.
1110010001001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1110010001001 is a deficient number, since it is larger than the sum of its proper divisors (527912704407).
1110010001001 is a wasteful number, since it uses less digits than its factorization.
1110010001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1596061.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1110010001001 its reverse (1001000100111), we get a palindrome (2111010101112).
It can be divided in two parts, 11 and 10010001001, that multiplied together give a palindrome (110110011011).
The spelling of 1110010001001 in words is "one trillion, one hundred ten billion, ten million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •