Base | Representation |
---|---|
bin | 110001001001111100… |
… | …1100100010111010101 |
3 | 101002110200210220110202 |
4 | 1202103321210113111 |
5 | 3212142000311023 |
6 | 120254401030245 |
7 | 10424613633662 |
oct | 1422371442725 |
9 | 332420726422 |
10 | 105560557013 |
11 | 4084a20096a |
12 | 18560025385 |
13 | 9c53836a72 |
14 | 517575ca69 |
15 | 2b2c4bc128 |
hex | 1893e645d5 |
105560557013 has 2 divisors, whose sum is σ = 105560557014. Its totient is φ = 105560557012.
The previous prime is 105560557007. The next prime is 105560557021. The reversal of 105560557013 is 310755065501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 66939660529 + 38620896484 = 258727^2 + 196522^2 .
It is an emirp because it is prime and its reverse (310755065501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105560557013 - 26 = 105560556949 is a prime.
It is a super-2 number, since 2×1055605570132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105560557313) 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, 52780278506 + 52780278507.
It is an arithmetic number, because the mean of its divisors is an integer number (52780278507).
Almost surely, 2105560557013 is an apocalyptic number.
It is an amenable number.
105560557013 is a deficient number, since it is larger than the sum of its proper divisors (1).
105560557013 is an equidigital number, since it uses as much as digits as its factorization.
105560557013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78750, while the sum is 38.
The spelling of 105560557013 in words is "one hundred five billion, five hundred sixty million, five hundred fifty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •