Search a number
-
+
55214025953 is a prime number
BaseRepresentation
bin110011011011000000…
…110010110011100001
312021111221221010121012
4303123000302303201
51401034242312303
641210500110305
73663153322412
oct633300626341
9167457833535
1055214025953
1121463972a09
12a84b095395
13528c056a98
14295adc5809
1516824c65d8
hexcdb032ce1

55214025953 has 2 divisors, whose sum is σ = 55214025954. Its totient is φ = 55214025952.

The previous prime is 55214025901. The next prime is 55214025961. The reversal of 55214025953 is 35952041255.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 49369729249 + 5844296704 = 222193^2 + 76448^2 .

It is a cyclic number.

It is not a de Polignac number, because 55214025953 - 214 = 55214009569 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 255214025953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 270000, while the sum is 41.

The spelling of 55214025953 in words is "fifty-five billion, two hundred fourteen million, twenty-five thousand, nine hundred fifty-three".