Search a number
-
+
102002053213961 is a prime number
BaseRepresentation
bin10111001100010100110100…
…001001011110111100001001
3111101011022010110122110022022
4113030110310021132330021
5101332200201110321321
61000535032451134225
730325255652523665
oct2714246411367411
9441138113573268
10102002053213961
112a55691193aaaa
12b5348212a4375
1344bb9a1b96904
141b28cd624d8a5
15bbd492b71dab
hex5cc53425ef09

102002053213961 has 2 divisors, whose sum is σ = 102002053213962. Its totient is φ = 102002053213960.

The previous prime is 102002053213867. The next prime is 102002053214011. The reversal of 102002053213961 is 169312350200201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97900338691600 + 4101714522361 = 9894460^2 + 2025269^2 .

It is a cyclic number.

It is not a de Polignac number, because 102002053213961 - 246 = 31633309036297 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2102002053213961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 19440, while the sum is 35.

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