Search a number
-
+
2464765957 is a prime number
BaseRepresentation
bin1001001011101001…
…0101100000000101
320100202220002021001
42102322111200011
520021440002312
61044324253301
7115036110403
oct22272254005
96322802231
102464765957
111055329165
12589541231
13303843cc4
141954bc473
15e65bb057
hex92e95805

2464765957 has 2 divisors, whose sum is σ = 2464765958. Its totient is φ = 2464765956.

The previous prime is 2464765909. The next prime is 2464765967. The reversal of 2464765957 is 7595674642.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2190333601 + 274432356 = 46801^2 + 16566^2 .

It is a cyclic number.

It is not a de Polignac number, because 2464765957 - 211 = 2464763909 is a prime.

It is a super-2 number, since 2×24647659572 = 12150142445572251698, which contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 22464765957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 12700800, while the sum is 55.

The square root of 2464765957 is about 49646.4093062127. The cubic root of 2464765957 is about 1350.8026241336.

The spelling of 2464765957 in words is "two billion, four hundred sixty-four million, seven hundred sixty-five thousand, nine hundred fifty-seven".