Search a number
-
+
10132002331123 is a prime number
BaseRepresentation
bin1001001101110000101001…
…1001100101100111110011
31022212121110122220110101011
42103130022121211213303
52312000320044043443
633314324433051351
72064004314552601
oct223341231454763
938777418813334
1010132002331123
113256a5a1a2162
1211777970b6b57
1358659cb1246a
1427056a4dc871
15128853979b9d
hex9370a6659f3

10132002331123 has 2 divisors, whose sum is σ = 10132002331124. Its totient is φ = 10132002331122.

The previous prime is 10132002331103. The next prime is 10132002331177. The reversal of 10132002331123 is 32113320023101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10132002331123 - 217 = 10132002200051 is a prime.

It is a super-2 number, since 2×101320023311232 (a number of 27 digits) contains 22 as substring.

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

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

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

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

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

Almost surely, 210132002331123 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 22.

Adding to 10132002331123 its reverse (32113320023101), we get a palindrome (42245322354224).

The spelling of 10132002331123 in words is "ten trillion, one hundred thirty-two billion, two million, three hundred thirty-one thousand, one hundred twenty-three".