Search a number
-
+
59593905097 is a prime number
BaseRepresentation
bin110111100000000100…
…101101001111001001
312200211012110001021021
4313200010231033021
51434022014430342
643213240112441
74206535556356
oct674004551711
9180735401237
1059593905097
1123301229a41
12b671a65721
13580959364c
142c5498362d
15183bc88567
hexde012d3c9

59593905097 has 2 divisors, whose sum is σ = 59593905098. Its totient is φ = 59593905096.

The previous prime is 59593905079. The next prime is 59593905101. The reversal of 59593905097 is 79050939595.

Together with previous prime (59593905079) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 55854704896 + 3739200201 = 236336^2 + 61149^2 .

It is a cyclic number.

It is not a de Polignac number, because 59593905097 - 27 = 59593904969 is a prime.

It is not a weakly prime, because it can be changed into another prime (59593905017) 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, 29796952548 + 29796952549.

It is an arithmetic number, because the mean of its divisors is an integer number (29796952549).

Almost surely, 259593905097 is an apocalyptic number.

It is an amenable number.

59593905097 is a deficient number, since it is larger than the sum of its proper divisors (1).

59593905097 is an equidigital number, since it uses as much as digits as its factorization.

59593905097 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 17222625, while the sum is 61.

The spelling of 59593905097 in words is "fifty-nine billion, five hundred ninety-three million, nine hundred five thousand, ninety-seven".