Search a number
-
+
1115157133 is a prime number
BaseRepresentation
bin100001001110111…
…1111001010001101
32212201100212000001
41002131333022031
54240440012013
6302353404301
736430451656
oct10235771215
92781325001
101115157133
11522528072
12271569691
1314a0599bc
14a816652d
1567d7bddd
hex4277f28d

1115157133 has 2 divisors, whose sum is σ = 1115157134. Its totient is φ = 1115157132.

The previous prime is 1115157119. The next prime is 1115157161. The reversal of 1115157133 is 3317515111.

It is an a-pointer prime, because the next prime (1115157161) can be obtained adding 1115157133 to its sum of digits (28).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1019077929 + 96079204 = 31923^2 + 9802^2 .

It is a cyclic number.

It is not a de Polignac number, because 1115157133 - 29 = 1115156621 is a prime.

It is a congruent number.

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

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

Almost surely, 21115157133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1575, while the sum is 28.

The square root of 1115157133 is about 33393.9685122928. The cubic root of 1115157133 is about 1036.9998388150. Note that the first 3 decimals are identical.

The spelling of 1115157133 in words is "one billion, one hundred fifteen million, one hundred fifty-seven thousand, one hundred thirty-three".