Base | Representation |
---|---|
bin | 10000001010110011011… |
… | …000100001000100000001 |
3 | 10221012222020120200111011 |
4 | 100022303120201010001 |
5 | 121201023421022123 |
6 | 2210234251120521 |
7 | 143163240416626 |
oct | 20126330410401 |
9 | 3835866520434 |
10 | 1111111110913 |
11 | 39924628a091 |
12 | 15b410a43141 |
13 | 80a14a3680b |
14 | 3bac701c34d |
15 | 1dd8118be0d |
hex | 102b3621101 |
1111111110913 has 2 divisors, whose sum is σ = 1111111110914. Its totient is φ = 1111111110912.
The previous prime is 1111111110833. The next prime is 1111111110971. The reversal of 1111111110913 is 3190111111111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 760092779889 + 351018331024 = 871833^2 + 592468^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111111110913 - 233 = 1102521176321 is a prime.
It is not a weakly prime, because it can be changed into another prime (1111111110113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555555555456 + 555555555457.
It is an arithmetic number, because the mean of its divisors is an integer number (555555555457).
Almost surely, 21111111110913 is an apocalyptic number.
It is an amenable number.
1111111110913 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111111110913 is an equidigital number, since it uses as much as digits as its factorization.
1111111110913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 22.
The spelling of 1111111110913 in words is "one trillion, one hundred eleven billion, one hundred eleven million, one hundred ten thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •