Search a number
-
+
1152004642141 is a prime number
BaseRepresentation
bin10000110000111000110…
…100111101010101011101
311002010112011222022101211
4100300320310331111131
5122333301142022031
62241120145304421
7146141514615013
oct20607064752535
94063464868354
101152004642141
11404620651391
12167324035111
1384830c59282
143da861408b3
151ee76323bb1
hex10c38d3d55d

1152004642141 has 2 divisors, whose sum is σ = 1152004642142. Its totient is φ = 1152004642140.

The previous prime is 1152004642121. The next prime is 1152004642171. The reversal of 1152004642141 is 1412464002511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 869649502500 + 282355139641 = 932550^2 + 531371^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1152004642141 is a prime.

It is a super-3 number, since 3×11520046421413 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

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

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

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

Almost surely, 21152004642141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1152004642141 its reverse (1412464002511), we get a palindrome (2564468644652).

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