Base | Representation |
---|---|
bin | 10000001001111000010… |
… | …100000111010010001001 |
3 | 10221010102011211011110100 |
4 | 100021320110013102021 |
5 | 121142011221213001 |
6 | 2205552050240013 |
7 | 143126545111122 |
oct | 20117024072211 |
9 | 3833364734410 |
10 | 1110120101001 |
11 | 39888794672a |
12 | 15b194b86009 |
13 | 808b7626612 |
14 | 3ba31571049 |
15 | 1dd24184586 |
hex | 10278507489 |
1110120101001 has 12 divisors (see below), whose sum is σ = 1646844835012. Its totient is φ = 720077903136.
The previous prime is 1110120100937. The next prime is 1110120101011. The reversal of 1110120101001 is 1001010210111.
It can be written as a sum of positive squares in 2 ways, for example, as 986883296400 + 123236804601 = 993420^2 + 351051^2 .
It is not a de Polignac number, because 1110120101001 - 26 = 1110120100937 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 not an unprimeable number, because it can be changed into a prime (1110120101011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1666846666 + ... + 1666847331.
Almost surely, 21110120101001 is an apocalyptic number.
It is an amenable number.
1110120101001 is a deficient number, since it is larger than the sum of its proper divisors (536724734011).
1110120101001 is a wasteful number, since it uses less digits than its factorization.
1110120101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3333694040 (or 3333694037 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1110120101001 its reverse (1001010210111), we get a palindrome (2111130311112).
It can be divided in two parts, 1110120 and 101001, that added together give a palindrome (1211121).
The spelling of 1110120101001 in words is "one trillion, one hundred ten billion, one hundred twenty million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •