Search a number
-
+
100102017121 is a prime number
BaseRepresentation
bin101110100111010001…
…0111001000001100001
3100120101021121100102121
41131032202321001201
53120002104021441
6113553005344241
710142423051341
oct1351642710141
9316337540377
10100102017121
11394a8a85077
1217497b68081
1395939ab3c2
144bb8818d21
15290d18bdd1
hex174e8b9061

100102017121 has 2 divisors, whose sum is σ = 100102017122. Its totient is φ = 100102017120.

The previous prime is 100102017109. The next prime is 100102017131. The reversal of 100102017121 is 121710201001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 81887545600 + 18214471521 = 286160^2 + 134961^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 100102017121 - 25 = 100102017089 is a prime.

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

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

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

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

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

Almost surely, 2100102017121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28, while the sum is 16.

Adding to 100102017121 its reverse (121710201001), we get a palindrome (221812218122).

The spelling of 100102017121 in words is "one hundred billion, one hundred two million, seventeen thousand, one hundred twenty-one".