Base | Representation |
---|---|
bin | 10011101110110110… |
… | …11001101000001101 |
3 | 1000100021201221200121 |
4 | 21313123121220031 |
5 | 133143430344112 |
6 | 4511105424541 |
7 | 523343111101 |
oct | 116733315015 |
9 | 30307657617 |
10 | 10593606157 |
11 | 45468a6112 |
12 | 207793b151 |
13 | cca987a14 |
14 | 726d23901 |
15 | 420066407 |
hex | 2776d9a0d |
10593606157 has 2 divisors, whose sum is σ = 10593606158. Its totient is φ = 10593606156.
The previous prime is 10593606113. The next prime is 10593606167. The reversal of 10593606157 is 75160639501.
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., 7636312996 + 2957293161 = 87386^2 + 54381^2 .
It is an emirp because it is prime and its reverse (75160639501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10593606157 is a prime.
It is a super-2 number, since 2×105936061572 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10593606167) 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, 5296803078 + 5296803079.
It is an arithmetic number, because the mean of its divisors is an integer number (5296803079).
Almost surely, 210593606157 is an apocalyptic number.
It is an amenable number.
10593606157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10593606157 is an equidigital number, since it uses as much as digits as its factorization.
10593606157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 170100, while the sum is 43.
The spelling of 10593606157 in words is "ten billion, five hundred ninety-three million, six hundred six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •