Search a number
-
+
55500016951 is a prime number
BaseRepresentation
bin110011101100000011…
…110000110100110111
312022020220001222111101
4303230003300310313
51402131001020301
641255113550531
74003225234411
oct635403606467
9168226058441
1055500016951
11215a0349205
12a90aa15447
13530638b322
142986d8d9b1
15169c669701
hexcec0f0d37

55500016951 has 2 divisors, whose sum is σ = 55500016952. Its totient is φ = 55500016950.

The previous prime is 55500016919. The next prime is 55500016993. The reversal of 55500016951 is 15961000555.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 55500016951 - 25 = 55500016919 is a prime.

It is a super-2 number, since 2×555000169512 (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 55500016951.

It is a congruent number.

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

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

Almost surely, 255500016951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 33750, while the sum is 37.

The spelling of 55500016951 in words is "fifty-five billion, five hundred million, sixteen thousand, nine hundred fifty-one".