Search a number
-
+
1152007066141 is a prime number
BaseRepresentation
bin10000110000111000111…
…110001101001000011101
311002010112100112110111121
4100300320332031020131
5122333302302104031
62241120313250541
7146141544332041
oct20607076151035
94063470473447
101152007066141
11404621a57598
12167324a03a51
13848315c76a9
143da865b2021
151ee76652011
hex10c38f8d21d

1152007066141 has 2 divisors, whose sum is σ = 1152007066142. Its totient is φ = 1152007066140.

The previous prime is 1152007066117. The next prime is 1152007066151. The reversal of 1152007066141 is 1416607002511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 899028245241 + 252978820900 = 948171^2 + 502970^2 .

It is a cyclic number.

It is not a de Polignac number, because 1152007066141 - 27 = 1152007066013 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21152007066141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10080, while the sum is 34.

The spelling of 1152007066141 in words is "one trillion, one hundred fifty-two billion, seven million, sixty-six thousand, one hundred forty-one".