Base | Representation |
---|---|
bin | 110011101111000100… |
… | …0101011110100110101 |
3 | 101121202211010121211101 |
4 | 1213132020223310311 |
5 | 3310013324013023 |
6 | 123012240010101 |
7 | 11012120632642 |
oct | 1473610536465 |
9 | 347684117741 |
10 | 111101001013 |
11 | 43132689502 |
12 | 19647600931 |
13 | a62763b3b2 |
14 | 553d502dc9 |
15 | 2d53aca1ad |
hex | 19de22bd35 |
111101001013 has 2 divisors, whose sum is σ = 111101001014. Its totient is φ = 111101001012.
The previous prime is 111101001007. The next prime is 111101001023. The reversal of 111101001013 is 310100101111.
It is an a-pointer prime, because the next prime (111101001023) can be obtained adding 111101001013 to its sum of digits (10).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106992447409 + 4108553604 = 327097^2 + 64098^2 .
It is a cyclic number.
It is not a de Polignac number, because 111101001013 - 25 = 111101000981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111101001023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550500506 + 55550500507.
It is an arithmetic number, because the mean of its divisors is an integer number (55550500507).
Almost surely, 2111101001013 is an apocalyptic number.
It is an amenable number.
111101001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
111101001013 is an equidigital number, since it uses as much as digits as its factorization.
111101001013 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 111101001013 its reverse (310100101111), we get a palindrome (421201102124).
The spelling of 111101001013 in words is "one hundred eleven billion, one hundred one million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •