Search a number
-
+
55442000231 is a prime number
BaseRepresentation
bin110011101000100110…
…011100100101100111
312022002211220102111222
4303220212130211213
51402021123001411
641245242250555
74001622140432
oct635046344547
9168084812458
1055442000231
1121570622402
12a8b34b6a5b
1352c7356cc7
14297d3aa819
1516975094db
hexce899c967

55442000231 has 2 divisors, whose sum is σ = 55442000232. Its totient is φ = 55442000230.

The previous prime is 55442000149. The next prime is 55442000233. The reversal of 55442000231 is 13200024455.

It is a happy number.

It is a strong prime.

It is a cyclic number.

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

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

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

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 255442000231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4800, while the sum is 26.

Adding to 55442000231 its reverse (13200024455), we get a palindrome (68642024686).

The spelling of 55442000231 in words is "fifty-five billion, four hundred forty-two million, two hundred thirty-one", and thus it is an aban number.