Search a number
-
+
10220113113113 is a prime number
BaseRepresentation
bin1001010010111000111000…
…1101100011000000011001
31100012000220020212221121002
42110232032031203000121
52314421242424104423
633423015524554345
72103243634054121
oct224561615430031
940160806787532
1010220113113113
113290364461852
1211908872529b5
135919a2407657
1427492853bc81
1512acae028228
hex94b8e363019

10220113113113 has 2 divisors, whose sum is σ = 10220113113114. Its totient is φ = 10220113113112.

The previous prime is 10220113113079. The next prime is 10220113113139. The reversal of 10220113113113 is 31131131102201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9308552184064 + 911560929049 = 3050992^2 + 954757^2 .

It is a cyclic number.

It is not a de Polignac number, because 10220113113113 - 220 = 10220112064537 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 (10220113113313) 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, 5110056556556 + 5110056556557.

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

Almost surely, 210220113113113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 20.

Adding to 10220113113113 its reverse (31131131102201), we get a palindrome (41351244215314).

The spelling of 10220113113113 in words is "ten trillion, two hundred twenty billion, one hundred thirteen million, one hundred thirteen thousand, one hundred thirteen".