Search a number
-
+
59107913 is a prime number
BaseRepresentation
bin1110000101111…
…0101001001001
311010012222210222
43201132221021
5110112423123
65510515425
71315260164
oct341365111
9133188728
1059107913
1130401717
1217965b75
13c326bc7
147bc8adb
1552c86c8
hex385ea49

59107913 has 2 divisors, whose sum is σ = 59107914. Its totient is φ = 59107912.

The previous prime is 59107871. The next prime is 59107921. The reversal of 59107913 is 31970195.

59107913 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 57577744 + 1530169 = 7588^2 + 1237^2 .

It is a cyclic number.

It is not a de Polignac number, because 59107913 - 222 = 54913609 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (59107973) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29553956 + 29553957.

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

Almost surely, 259107913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8505, while the sum is 35.

The square root of 59107913 is about 7688.1670767485. The cubic root of 59107913 is about 389.5368444424.

The spelling of 59107913 in words is "fifty-nine million, one hundred seven thousand, nine hundred thirteen".