Search a number
-
+
1156092137 is a prime number
BaseRepresentation
bin100010011101000…
…1001000011101001
32222120101120021022
41010322021003221
54331424422022
6310415022225
740435423004
oct10472110351
92876346238
101156092137
11543647152
1228320a975
1315568ccb5
14ad78053b
156b765c42
hex44e890e9

1156092137 has 2 divisors, whose sum is σ = 1156092138. Its totient is φ = 1156092136.

The previous prime is 1156092101. The next prime is 1156092149. The reversal of 1156092137 is 7312906511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 666620761 + 489471376 = 25819^2 + 22124^2 .

It is a cyclic number.

It is not a de Polignac number, because 1156092137 - 216 = 1156026601 is a prime.

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

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

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

Almost surely, 21156092137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1156092137 is about 34001.3549288848. The cubic root of 1156092137 is about 1049.5363446483.

Adding to 1156092137 its reverse (7312906511), we get a palindrome (8468998648).

The spelling of 1156092137 in words is "one billion, one hundred fifty-six million, ninety-two thousand, one hundred thirty-seven".