Search a number
-
+
56050010231 is a prime number
BaseRepresentation
bin110100001100110101…
…110100100001110111
312100200012222112102212
4310030311310201313
51404242300311411
641425442124035
74022654140355
oct641465644167
9170605875385
1056050010231
1121852851306
12aa4305061b
1353932c8737
1429da03a7d5
1516d0aaa68b
hexd0cd74877

56050010231 has 2 divisors, whose sum is σ = 56050010232. Its totient is φ = 56050010230.

The previous prime is 56050010213. The next prime is 56050010251. The reversal of 56050010231 is 13201005065.

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

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-56050010231 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 256050010231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 23.

Adding to 56050010231 its reverse (13201005065), we get a palindrome (69251015296).

The spelling of 56050010231 in words is "fifty-six billion, fifty million, ten thousand, two hundred thirty-one".