Base | Representation |
---|---|
bin | 11001001111010000110011… |
… | …101000101101111111111101 |
3 | 112120000111101221001121020201 |
4 | 121033100303220231333331 |
5 | 104022111000241010023 |
6 | 1032024410242043501 |
7 | 32244325334641021 |
oct | 3117206350557775 |
9 | 476014357047221 |
10 | 111000001110013 |
11 | 32405921954054 |
12 | 10548663949591 |
13 | 49c23418682c2 |
14 | 1d5a600596381 |
15 | cc75710e7bad |
hex | 64f433a2dffd |
111000001110013 has 2 divisors, whose sum is σ = 111000001110014. Its totient is φ = 111000001110012.
The previous prime is 111000001109999. The next prime is 111000001110049. The reversal of 111000001110013 is 310011100000111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97967771149689 + 13032229960324 = 9897867^2 + 3610018^2 .
It is a cyclic number.
It is not a de Polignac number, because 111000001110013 - 25 = 111000001109981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111000001110083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55500000555006 + 55500000555007.
It is an arithmetic number, because the mean of its divisors is an integer number (55500000555007).
Almost surely, 2111000001110013 is an apocalyptic number.
It is an amenable number.
111000001110013 is a deficient number, since it is larger than the sum of its proper divisors (1).
111000001110013 is an equidigital number, since it uses as much as digits as its factorization.
111000001110013 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 111000001110013 its reverse (310011100000111), we get a palindrome (421011101110124).
The spelling of 111000001110013 in words is "one hundred eleven trillion, one million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •