Search a number
-
+
2774456497 is a prime number
BaseRepresentation
bin1010010101011110…
…1101100010110001
321011100121222211001
42211113231202301
521140230101442
61135150122001
7125516330311
oct24527554261
97140558731
102774456497
1111a412125a
126551b0301
13352a55847
141c4695441
151138912b7
hexa55ed8b1

2774456497 has 2 divisors, whose sum is σ = 2774456498. Its totient is φ = 2774456496.

The previous prime is 2774456479. The next prime is 2774456539. The reversal of 2774456497 is 7946544772.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2010984336 + 763472161 = 44844^2 + 27631^2 .

It is a cyclic number.

It is not a de Polignac number, because 2774456497 - 27 = 2774456369 is a prime.

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

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

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

Almost surely, 22774456497 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 2774456497 is about 52673.1098094654. The cubic root of 2774456497 is about 1405.1606300562.

The spelling of 2774456497 in words is "two billion, seven hundred seventy-four million, four hundred fifty-six thousand, four hundred ninety-seven".