Search a number
-
+
51599010601 is a prime number
BaseRepresentation
bin110000000011100010…
…100110101100101001
311221012000122022210201
4300003202212230221
51321133321314401
635412041512201
73504446232145
oct600342465451
9157160568721
1051599010601
111a979329416
12a0004a2661
134b3411a348
1426d6c48225
15151ee4ab01
hexc038a6b29

51599010601 has 2 divisors, whose sum is σ = 51599010602. Its totient is φ = 51599010600.

The previous prime is 51599010473. The next prime is 51599010653. The reversal of 51599010601 is 10601099515.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 34926003225 + 16673007376 = 186885^2 + 129124^2 .

It is a cyclic number.

It is not a de Polignac number, because 51599010601 - 27 = 51599010473 is a prime.

It is a super-2 number, since 2×515990106012 (a number of 22 digits) contains 22 as substring.

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

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

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

Almost surely, 251599010601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12150, while the sum is 37.

The spelling of 51599010601 in words is "fifty-one billion, five hundred ninety-nine million, ten thousand, six hundred one".