Base | Representation |
---|---|
bin | 101000011011000000011… |
… | …1010100101100100001001 |
3 | 201200002212012220110211211 |
4 | 1100312000322211210021 |
5 | 1212010234210234333 |
6 | 15452104220053121 |
7 | 1112242563032401 |
oct | 120660072454411 |
9 | 21602765813754 |
10 | 5555555555593 |
11 | 185210930716a |
12 | 7588543941a1 |
13 | 313b6ac47754 |
14 | 152c67095801 |
15 | 997a57deecd |
hex | 50d80ea5909 |
5555555555593 has 2 divisors, whose sum is σ = 5555555555594. Its totient is φ = 5555555555592.
The previous prime is 5555555555551. The next prime is 5555555555603. The reversal of 5555555555593 is 3955555555555.
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., 3605756647689 + 1949798907904 = 1898883^2 + 1396352^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5555555555593 is a prime.
It is not a weakly prime, because it can be changed into another prime (5555555553593) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2777777777796 + 2777777777797.
It is an arithmetic number, because the mean of its divisors is an integer number (2777777777797).
Almost surely, 25555555555593 is an apocalyptic number.
It is an amenable number.
5555555555593 is a deficient number, since it is larger than the sum of its proper divisors (1).
5555555555593 is an equidigital number, since it uses as much as digits as its factorization.
5555555555593 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1318359375, while the sum is 67.
It can be divided in two parts, 55555555555 and 93, that multiplied together give a palindrome (5166666666615).
The spelling of 5555555555593 in words is "five trillion, five hundred fifty-five billion, five hundred fifty-five million, five hundred fifty-five thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •