Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …110001101000000111101 |
3 | 10221010002212220212000000 |
4 | 100021301032031000331 |
5 | 121141240241023401 |
6 | 2205532200024513 |
7 | 143123601524601 |
oct | 20116116150075 |
9 | 3833085825000 |
10 | 1110001111101 |
11 | 398826764873 |
12 | 15b161162139 |
13 | 80898a943ac |
14 | 3ba1d839501 |
15 | 1dd189cd186 |
hex | 1027138d03d |
1110001111101 has 14 divisors (see below), whose sum is σ = 1664240350110. Its totient is φ = 740000740248.
The previous prime is 1110001111081. The next prime is 1110001111199. The reversal of 1110001111101 is 1011111000111.
It can be written as a sum of positive squares in only one way, i.e., 660261879225 + 449739231876 = 812565^2 + 670626^2 .
It is not a de Polignac number, because 1110001111101 - 25 = 1110001111069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110001113101) 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 13 ways as a sum of consecutive naturals, for example, 761316906 + ... + 761318363.
Almost surely, 21110001111101 is an apocalyptic number.
It is an amenable number.
1110001111101 is a deficient number, since it is larger than the sum of its proper divisors (554239239009).
1110001111101 is an frugal number, since it uses more digits than its factorization.
1110001111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1522635287 (or 1522635272 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1110001111101 its reverse (1011111000111), we get a palindrome (2121112111212).
The spelling of 1110001111101 in words is "one trillion, one hundred ten billion, one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •