Search a number
-
+
2057672497 is a prime number
BaseRepresentation
bin111101010100101…
…1001011100110001
312022101212121000111
41322221121130301
513203231004442
6540103021321
7101663633116
oct17251313461
95271777014
102057672497
11966558891
1249513a841
1326a3baaba
141573cc90d
15c09a5b17
hex7aa59731

2057672497 has 2 divisors, whose sum is σ = 2057672498. Its totient is φ = 2057672496.

The previous prime is 2057672369. The next prime is 2057672569. The reversal of 2057672497 is 7942767502.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1794454321 + 263218176 = 42361^2 + 16224^2 .

It is a cyclic number.

It is not a de Polignac number, because 2057672497 - 27 = 2057672369 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 2057672497.

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

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

Almost surely, 22057672497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1481760, while the sum is 49.

The square root of 2057672497 is about 45361.5751159503. The cubic root of 2057672497 is about 1271.9169383367.

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