Search a number
-
+
56960413753 is a prime number
BaseRepresentation
bin110101000011000110…
…101111000000111001
312110000200001211021211
4311003012233000321
51413123331220003
642100043203121
74054350346135
oct650306570071
9173020054254
1056960413753
112217a739a11
12b057b164a1
1354a9ac5549
142a84d043c5
15173598e96d
hexd431af039

56960413753 has 2 divisors, whose sum is σ = 56960413754. Its totient is φ = 56960413752.

The previous prime is 56960413751. The next prime is 56960413787. The reversal of 56960413753 is 35731406965.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 48054339369 + 8906074384 = 219213^2 + 94372^2 .

It is a cyclic number.

It is not a de Polignac number, because 56960413753 - 21 = 56960413751 is a prime.

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

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

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

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

Almost surely, 256960413753 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 56960413753 in words is "fifty-six billion, nine hundred sixty million, four hundred thirteen thousand, seven hundred fifty-three".