Search a number
-
+
100021100211997 is a prime number
BaseRepresentation
bin10110101111011111111010…
…001001011110111100011101
3111010010220221110002100122221
4112233133322021132330131
5101102221203123240442
6552421020433305341
730032200051034266
oct2657377211367435
9433126843070587
10100021100211997
112996278a585808
12b274914105251
1343a6c45746ba3
141a9b09328d96d
15b86ba1e14467
hex5af7fa25ef1d

100021100211997 has 2 divisors, whose sum is σ = 100021100211998. Its totient is φ = 100021100211996.

The previous prime is 100021100211943. The next prime is 100021100212021. The reversal of 100021100211997 is 799112001120001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99000689108281 + 1020411103716 = 9949909^2 + 1010154^2 .

It is a cyclic number.

It is not a de Polignac number, because 100021100211997 - 27 = 100021100211869 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2100021100211997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2268, while the sum is 34.

Adding to 100021100211997 its reverse (799112001120001), we get a palindrome (899133101331998).

The spelling of 100021100211997 in words is "one hundred trillion, twenty-one billion, one hundred million, two hundred eleven thousand, nine hundred ninety-seven".