Search a number
-
+
56786429537 is a prime number
BaseRepresentation
bin110100111000101111…
…000010011001100001
312102120112200111210222
4310320233002121201
51412244311221122
642030510132425
74050135454415
oct647057023141
9172515614728
1056786429537
11220a0506002
12b0097b1115
13547ca498c6
142a69b74d45
151725573b42
hexd38bc2661

56786429537 has 2 divisors, whose sum is σ = 56786429538. Its totient is φ = 56786429536.

The previous prime is 56786429501. The next prime is 56786429599. The reversal of 56786429537 is 73592468765.

It is an a-pointer prime, because the next prime (56786429599) can be obtained adding 56786429537 to its sum of digits (62).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 48700103761 + 8086325776 = 220681^2 + 89924^2 .

It is a cyclic number.

It is not a de Polignac number, because 56786429537 - 26 = 56786429473 is a prime.

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

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

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

Almost surely, 256786429537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 76204800, while the sum is 62.

The spelling of 56786429537 in words is "fifty-six billion, seven hundred eighty-six million, four hundred twenty-nine thousand, five hundred thirty-seven".