Search a number
-
+
100200221111 is a prime number
BaseRepresentation
bin101110101010001100…
…1100000100110110111
3100120122010101121222102
41131110121200212313
53120202224033421
6114010434252315
710145024553344
oct1352431404667
9316563347872
10100200221111
113954945a1a1
1217504a2709b
1395ab143583
144bc789d7cb
152916ad960b
hex17546609b7

100200221111 has 2 divisors, whose sum is σ = 100200221112. Its totient is φ = 100200221110.

The previous prime is 100200221081. The next prime is 100200221117. The reversal of 100200221111 is 111122002001.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-100200221111 is a prime.

It is a super-4 number, since 4×1002002211114 (a number of 45 digits) contains 4444 as substring.

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2100200221111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 11.

Adding to 100200221111 its reverse (111122002001), we get a palindrome (211322223112).

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