Search a number
-
+
11625807737 is a prime number
BaseRepresentation
bin10101101001111001…
…11011111101111001
31010000020000020001202
422310330323331321
5142302201321422
65201341223545
7561045510125
oct126474737571
933006006052
1011625807737
114a26513475
122305561bb5
13113378ac9b
147c4054585
154809a8b92
hex2b4f3bf79

11625807737 has 2 divisors, whose sum is σ = 11625807738. Its totient is φ = 11625807736.

The previous prime is 11625807691. The next prime is 11625807749. The reversal of 11625807737 is 73770852611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11515221481 + 110586256 = 107309^2 + 10516^2 .

It is an emirp because it is prime and its reverse (73770852611) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11625807737 - 216 = 11625742201 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 11625807691 and 11625807700.

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

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

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

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

Almost surely, 211625807737 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 493920, while the sum is 47.

The spelling of 11625807737 in words is "eleven billion, six hundred twenty-five million, eight hundred seven thousand, seven hundred thirty-seven".