Search a number
-
+
1555963147 is a prime number
BaseRepresentation
bin101110010111110…
…0001110100001011
311000102211010011201
41130233201310023
511141311310042
6414221405031
753362316464
oct13457416413
94012733151
101555963147
11729334162
12375109777
131ba48796b
1410a90dd6b
15919011b7
hex5cbe1d0b

1555963147 has 2 divisors, whose sum is σ = 1555963148. Its totient is φ = 1555963146.

The previous prime is 1555963141. The next prime is 1555963229. The reversal of 1555963147 is 7413695551.

It is a weak prime.

It is an emirp because it is prime and its reverse (7413695551) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1555963147 - 23 = 1555963139 is a prime.

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

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

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

Almost surely, 21555963147 is an apocalyptic number.

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

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

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

The product of its digits is 567000, while the sum is 46.

The square root of 1555963147 is about 39445.6987135480. The cubic root of 1555963147 is about 1158.7767393665.

The spelling of 1555963147 in words is "one billion, five hundred fifty-five million, nine hundred sixty-three thousand, one hundred forty-seven".