Search a number
-
+
102001110200051 is a prime number
BaseRepresentation
bin10111001100010011111011…
…111100001010111011110011
3111101011012200202012101102012
4113030103323330022323303
5101332141233202400201
61000534355123113135
730325223412165206
oct2714237374127363
9441135622171365
10102001110200051
112a5564785a9767
12b5345b95127ab
1344bb8816bc90a
141b28c46cd793d
15bbd439e9a5bb
hex5cc4fbf0aef3

102001110200051 has 2 divisors, whose sum is σ = 102001110200052. Its totient is φ = 102001110200050.

The previous prime is 102001110199997. The next prime is 102001110200053. The reversal of 102001110200051 is 150002011100201.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 102001110200051 - 214 = 102001110183667 is a prime.

Together with 102001110200053, it forms a pair of twin primes.

It is a Chen prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2102001110200051 is an apocalyptic number.

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

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

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

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

Adding to 102001110200051 its reverse (150002011100201), we get a palindrome (252003121300252).

The spelling of 102001110200051 in words is "one hundred two trillion, one billion, one hundred ten million, two hundred thousand, fifty-one".