Search a number
-
+
102012330111217 is a prime number
BaseRepresentation
bin10111001100011110011000…
…101100101111000011110001
3111101012021122200102221001121
4113030132120230233003301
5101332332223002024332
61000543452324502241
730326101431644401
oct2714363054570361
9441167580387047
10102012330111217
112a56020598a019
12b53680ab4a981
1344bc94c0533c6
141b295cd090801
15bbd894ec8797
hex5cc798b2f0f1

102012330111217 has 2 divisors, whose sum is σ = 102012330111218. Its totient is φ = 102012330111216.

The previous prime is 102012330111179. The next prime is 102012330111227. The reversal of 102012330111217 is 712111033210201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 74891992928256 + 27120337182961 = 8654016^2 + 5207719^2 .

It is a cyclic number.

It is not a de Polignac number, because 102012330111217 - 211 = 102012330109169 is a prime.

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

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

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

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

Almost surely, 2102012330111217 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 102012330111217 its reverse (712111033210201), we get a palindrome (814123363321418).

The spelling of 102012330111217 in words is "one hundred two trillion, twelve billion, three hundred thirty million, one hundred eleven thousand, two hundred seventeen".