Search a number
-
+
10211011002131 is a prime number
BaseRepresentation
bin1001010010010110111110…
…1011101111111100010011
31100011011101220122210122112
42110211233223233330103
52314244122304032011
633414512415055535
72102502241306322
oct224455753577423
940134356583575
1010211011002131
113287513568085
12118ab66b115ab
13590b81754a74
142743037460b9
1512a929dcb58b
hex9496faeff13

10211011002131 has 2 divisors, whose sum is σ = 10211011002132. Its totient is φ = 10211011002130.

The previous prime is 10211011002113. The next prime is 10211011002161. The reversal of 10211011002131 is 13120011011201.

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

It is a weak prime.

It is an emirp because it is prime and its reverse (13120011011201) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10211011002131 - 26 = 10211011002067 is a prime.

It is a super-2 number, since 2×102110110021312 (a number of 27 digits) contains 22 as substring.

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

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

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

Almost surely, 210211011002131 is an apocalyptic number.

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

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

10211011002131 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 10211011002131 its reverse (13120011011201), we get a palindrome (23331022013332).

The spelling of 10211011002131 in words is "ten trillion, two hundred eleven billion, eleven million, two thousand, one hundred thirty-one".