Search a number
-
+
56047687331 is a prime number
BaseRepresentation
bin110100001100101100…
…111101011010100011
312100200001121112000112
4310030230331122203
51404241201443311
641425320241535
74022625324146
oct641454753243
9170601545015
1056047687331
1121851505059
12aa423102ab
13539299433c
1429d99d405d
1516d079c28b
hexd0cb3d6a3

56047687331 has 2 divisors, whose sum is σ = 56047687332. Its totient is φ = 56047687330.

The previous prime is 56047687313. The next prime is 56047687343. The reversal of 56047687331 is 13378674065.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 56047687331 - 214 = 56047670947 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (56047687351) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28023843665 + 28023843666.

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

Almost surely, 256047687331 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2540160, while the sum is 50.

The spelling of 56047687331 in words is "fifty-six billion, forty-seven million, six hundred eighty-seven thousand, three hundred thirty-one".