Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …01110110110100000011 |
3 | 10112201000101110212012212 |
4 | 32210112031312310003 |
5 | 112400223112023412 |
6 | 2043522105412335 |
7 | 132220123354025 |
oct | 16442615666403 |
9 | 3481011425185 |
10 | 1001100111107 |
11 | 356622a06728 |
12 | 14202a49a0ab |
13 | 73532187c65 |
14 | 3664c5b4015 |
15 | 1b093120222 |
hex | e916376d03 |
1001100111107 has 2 divisors, whose sum is σ = 1001100111108. Its totient is φ = 1001100111106.
The previous prime is 1001100111079. The next prime is 1001100111113. The reversal of 1001100111107 is 7011110011001.
1001100111107 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1001100111107 - 212 = 1001100107011 is a prime.
It is a super-3 number, since 3×10011001111073 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1001100111091 and 1001100111100.
It is not a weakly prime, because it can be changed into another prime (1001100114107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500550055553 + 500550055554.
It is an arithmetic number, because the mean of its divisors is an integer number (500550055554).
Almost surely, 21001100111107 is an apocalyptic number.
1001100111107 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001100111107 is an equidigital number, since it uses as much as digits as its factorization.
1001100111107 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 14.
Adding to 1001100111107 its reverse (7011110011001), we get a palindrome (8012210122108).
The spelling of 1001100111107 in words is "one trillion, one billion, one hundred million, one hundred eleven thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •