Search a number
-
+
55196819 is a prime number
BaseRepresentation
bin1101001010001…
…1110010010011
310211212021210122
43102203302103
5103112244234
65251020455
71240110446
oct322436223
9124767718
1055196819
1129180207
121659a72b
13b587952
14748b65d
154ca492e
hex34a3c93

55196819 has 2 divisors, whose sum is σ = 55196820. Its totient is φ = 55196818.

The previous prime is 55196789. The next prime is 55196863. The reversal of 55196819 is 91869155.

55196819 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an a-pointer prime, because the next prime (55196863) can be obtained adding 55196819 to its sum of digits (44).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 55196819 - 220 = 54148243 is a prime.

It is a super-2 number, since 2×551968192 = 6093377655437522, which contains 22 as substring.

It is a Sophie Germain prime.

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

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

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

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

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

Almost surely, 255196819 is an apocalyptic number.

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

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

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

The product of its digits is 97200, while the sum is 44.

The square root of 55196819 is about 7429.4561712147. The cubic root of 55196819 is about 380.7483383407.

The spelling of 55196819 in words is "fifty-five million, one hundred ninety-six thousand, eight hundred nineteen".