Search a number
-
+
1157048147 is a prime number
BaseRepresentation
bin100010011110111…
…0010011101010011
32222122012010200002
41010331302131103
54332201020042
6310451320215
740446514133
oct10475623523
92878163602
101157048147
1154413a442
122835b006b
13155936198
14ad94cac3
156b8a4132
hex44f72753

1157048147 has 2 divisors, whose sum is σ = 1157048148. Its totient is φ = 1157048146.

The previous prime is 1157048059. The next prime is 1157048197. The reversal of 1157048147 is 7418407511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1157048147 - 222 = 1152853843 is a prime.

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

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

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

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

Almost surely, 21157048147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 31360, while the sum is 38.

The square root of 1157048147 is about 34015.4104340959. The cubic root of 1157048147 is about 1049.8255634639.

The spelling of 1157048147 in words is "one billion, one hundred fifty-seven million, forty-eight thousand, one hundred forty-seven".