Search a number
-
+
1002303152161 is a prime number
BaseRepresentation
bin11101001010111011110…
…11000110000000100001
310112211010020012200021221
432211131323012000201
5112410204101332121
62044241323015041
7132262002136243
oct16453573060041
93484106180257
101002303152161
1135708aaaa233
1214230536a481
13736944a567c
1436724296093
151b113a5bb41
hexe95dec6021

1002303152161 has 2 divisors, whose sum is σ = 1002303152162. Its totient is φ = 1002303152160.

The previous prime is 1002303152141. The next prime is 1002303152233. The reversal of 1002303152161 is 1612513032001.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 852955685136 + 149347467025 = 923556^2 + 386455^2 .

It is a cyclic number.

It is not a de Polignac number, because 1002303152161 - 25 = 1002303152129 is a prime.

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

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

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

Almost surely, 21002303152161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 25.

Adding to 1002303152161 its reverse (1612513032001), we get a palindrome (2614816184162).

The spelling of 1002303152161 in words is "one trillion, two billion, three hundred three million, one hundred fifty-two thousand, one hundred sixty-one".