Search a number
-
+
56980472357 is a prime number
BaseRepresentation
bin110101000100010011…
…010000001000100101
312110002001210220112002
4311010103100020211
51413144000103412
642102041135045
74055013011054
oct650423201045
9173061726462
1056980472357
112218aa9a276
12b06278a485
1354b0cc9543
142a8784639b
151737602dc2
hexd444d0225

56980472357 has 2 divisors, whose sum is σ = 56980472358. Its totient is φ = 56980472356.

The previous prime is 56980472327. The next prime is 56980472359. The reversal of 56980472357 is 75327408965.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 51860497441 + 5119974916 = 227729^2 + 71554^2 .

It is a cyclic number.

It is not a de Polignac number, because 56980472357 - 210 = 56980471333 is a prime.

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

Together with 56980472359, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 256980472357 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12700800, while the sum is 56.

The spelling of 56980472357 in words is "fifty-six billion, nine hundred eighty million, four hundred seventy-two thousand, three hundred fifty-seven".