Search a number
-
+
102003101079161 is a prime number
BaseRepresentation
bin10111001100010101110010…
…100110110001011001111001
3111101011101211111101112010112
4113030111302212301121321
5101332204322334013121
61000535324442354105
730325323635321402
oct2714256246613171
9441141744345115
10102003101079161
112a5572aa3866a7
12b534a741bb935
1344bbb0acc25a9
141b28d9549a9a9
15bbd504b5a75b
hex5cc5729b1679

102003101079161 has 2 divisors, whose sum is σ = 102003101079162. Its totient is φ = 102003101079160.

The previous prime is 102003101079107. The next prime is 102003101079179. The reversal of 102003101079161 is 161970101300201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 98470791330025 + 3532309749136 = 9923245^2 + 1879444^2 .

It is a cyclic number.

It is not a de Polignac number, because 102003101079161 - 214 = 102003101062777 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 (102003101079461) by changing a digit.

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

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

Almost surely, 2102003101079161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2268, while the sum is 32.

Adding to 102003101079161 its reverse (161970101300201), we get a palindrome (263973202379362).

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