Search a number
-
+
1154049137 is a prime number
BaseRepresentation
bin100010011001001…
…0110010001110001
32222102112202210122
41010302112101301
54330414033022
6310303140025
740412153513
oct10462262161
92872482718
101154049137
1154248121a
122825a4615
13155126117
14ad3abbb3
156b4b0742
hex44c96471

1154049137 has 2 divisors, whose sum is σ = 1154049138. Its totient is φ = 1154049136.

The previous prime is 1154049103. The next prime is 1154049157. The reversal of 1154049137 is 7319404511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1124193841 + 29855296 = 33529^2 + 5464^2 .

It is a cyclic number.

It is not a de Polignac number, because 1154049137 - 26 = 1154049073 is a prime.

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

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

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

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

Almost surely, 21154049137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15120, while the sum is 35.

The square root of 1154049137 is about 33971.2987240700. The cubic root of 1154049137 is about 1048.9177471696.

The spelling of 1154049137 in words is "one billion, one hundred fifty-four million, forty-nine thousand, one hundred thirty-seven".