Search a number
-
+
10322113110209 is a prime number
BaseRepresentation
bin1001011000110100110111…
…1000101010000011000001
31100112210011210212200002022
42112031031320222003001
52323104141424011314
633541525134531225
72113514404533005
oct226151570520301
940483153780068
1010322113110209
11331a64683230a
1211a85b2966b15
1359b4a9390014
14279843056705
1512d77db2478e
hex9634de2a0c1

10322113110209 has 2 divisors, whose sum is σ = 10322113110210. Its totient is φ = 10322113110208.

The previous prime is 10322113110203. The next prime is 10322113110233. The reversal of 10322113110209 is 90201131122301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9751224063025 + 570889047184 = 3122695^2 + 755572^2 .

It is a cyclic number.

It is not a de Polignac number, because 10322113110209 - 28 = 10322113109953 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 (10322113110203) 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, 5161056555104 + 5161056555105.

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

Almost surely, 210322113110209 is an apocalyptic number.

It is an amenable number.

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

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

10322113110209 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 26.

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