Search a number
-
+
10211011002113 is a prime number
BaseRepresentation
bin1001010010010110111110…
…1011101111111100000001
31100011011101220122210121212
42110211233223233330001
52314244122304031423
633414512415055505
72102502241306265
oct224455753577401
940134356583555
1010211011002113
113287513568069
12118ab66b11595
13590b81754a5c
142743037460a5
1512a929dcb578
hex9496faeff01

10211011002113 has 2 divisors, whose sum is σ = 10211011002114. Its totient is φ = 10211011002112.

The previous prime is 10211011002107. The next prime is 10211011002131. The reversal of 10211011002113 is 31120011011201.

Together with next prime (10211011002131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9082098377104 + 1128912625009 = 3013652^2 + 1062503^2 .

It is a cyclic number.

It is not a de Polignac number, because 10211011002113 - 24 = 10211011002097 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 (10211011002713) by changing a digit.

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

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

Almost surely, 210211011002113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 14.

Adding to 10211011002113 its reverse (31120011011201), we get a palindrome (41331022013314).

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