Search a number
-
+
14555939 is a prime number
BaseRepresentation
bin110111100001…
…101100100011
31000101111222212
4313201230203
512211242224
61235552335
7234503066
oct67415443
930344885
1014555939
118242102
124a5b6ab
1330284a8
141d0c8dd
151427d0e
hexde1b23

14555939 has 2 divisors, whose sum is σ = 14555940. Its totient is φ = 14555938.

The previous prime is 14555909. The next prime is 14555963. The reversal of 14555939 is 93955541.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 14555939 - 220 = 13507363 is a prime.

It is a Sophie Germain prime.

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

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

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

Almost surely, 214555939 is an apocalyptic number.

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

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

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

The product of its digits is 121500, while the sum is 41.

The square root of 14555939 is about 3815.2246329672. The cubic root of 14555939 is about 244.1631254882.

The spelling of 14555939 in words is "fourteen million, five hundred fifty-five thousand, nine hundred thirty-nine".