Base | Representation |
---|---|
bin | 10000001010110010101… |
… | …110100000110110101101 |
3 | 10221012221110212021101001 |
4 | 100022302232200312231 |
5 | 121201013111200023 |
6 | 2210233215120301 |
7 | 143163045010111 |
oct | 20126256406655 |
9 | 3835843767331 |
10 | 1111100100013 |
11 | 399240049472 |
12 | 15b409213091 |
13 | 80a1267caa7 |
14 | 3bac5793741 |
15 | 1dd802146ad |
hex | 102b2ba0dad |
1111100100013 has 2 divisors, whose sum is σ = 1111100100014. Its totient is φ = 1111100100012.
The previous prime is 1111100099971. The next prime is 1111100100029. The reversal of 1111100100013 is 3100010011111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 812588664969 + 298511435044 = 901437^2 + 546362^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111100100013 - 237 = 973661146541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111100100083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555550050006 + 555550050007.
It is an arithmetic number, because the mean of its divisors is an integer number (555550050007).
Almost surely, 21111100100013 is an apocalyptic number.
It is an amenable number.
1111100100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111100100013 is an equidigital number, since it uses as much as digits as its factorization.
1111100100013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 1111100100013 its reverse (3100010011111), we get a palindrome (4211110111124).
The spelling of 1111100100013 in words is "one trillion, one hundred eleven billion, one hundred million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •