Search a number
-
+
1152150529 is a prime number
BaseRepresentation
bin100010010101100…
…0110110000000001
32222021222022101211
41010223012300001
54324422304104
6310154330121
740360055305
oct10453066001
92867868354
101152150529
115413a4822
12281a29941
1315490cb9a
14ad035d05
156b237e04
hex44ac6c01

1152150529 has 2 divisors, whose sum is σ = 1152150530. Its totient is φ = 1152150528.

The previous prime is 1152150521. The next prime is 1152150533. The reversal of 1152150529 is 9250512511.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1002039025 + 150111504 = 31655^2 + 12252^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1152150529 - 23 = 1152150521 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (1152150521) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 576075264 + 576075265.

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

Almost surely, 21152150529 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 31.

The square root of 1152150529 is about 33943.3429261173. The cubic root of 1152150529 is about 1048.3422151373.

The spelling of 1152150529 in words is "one billion, one hundred fifty-two million, one hundred fifty thousand, five hundred twenty-nine".