Base | Representation |
---|---|
bin | 10000001001110111101… |
… | …110000000010100011001 |
3 | 10221010101111000121202100 |
4 | 100021313232000110121 |
5 | 121142001142023001 |
6 | 2205551052154013 |
7 | 143126364152553 |
oct | 20116756002431 |
9 | 3833344017670 |
10 | 1110110111001 |
11 | 398882243031 |
12 | 15b191768909 |
13 | 808b5539488 |
14 | 3ba300d04d3 |
15 | 1dd2335e586 |
hex | 10277b80519 |
1110110111001 has 12 divisors (see below), whose sum is σ = 1646830015012. Its totient is φ = 720071423136.
The previous prime is 1110110110969. The next prime is 1110110111003. The reversal of 1110110111001 is 1001110110111.
It can be written as a sum of positive squares in 2 ways, for example, as 453198240000 + 656911871001 = 673200^2 + 810501^2 .
It is not a de Polignac number, because 1110110111001 - 25 = 1110110110969 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 (1110110111003) 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 11 ways as a sum of consecutive naturals, for example, 1666831666 + ... + 1666832331.
Almost surely, 21110110111001 is an apocalyptic number.
It is an amenable number.
1110110111001 is a deficient number, since it is larger than the sum of its proper divisors (536719904011).
1110110111001 is a wasteful number, since it uses less digits than its factorization.
1110110111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3333664040 (or 3333664037 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1110110111001 its reverse (1001110110111), we get a palindrome (2111220221112).
The spelling of 1110110111001 in words is "one trillion, one hundred ten billion, one hundred ten million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •