Search a number
-
+
10100220111031 is a prime number
BaseRepresentation
bin1001001011111010010000…
…0010000010100010110111
31022202120102201001101122111
42102332210002002202313
52310440222322023111
633251551013511451
72061500604261031
oct222764402024267
938676381041574
1010100220111031
11324452aa38866
1211715a7342587
135835a644407b
1426cbd34c8c51
15127ae365aa21
hex92fa40828b7

10100220111031 has 2 divisors, whose sum is σ = 10100220111032. Its totient is φ = 10100220111030.

The previous prime is 10100220110921. The next prime is 10100220111061. The reversal of 10100220111031 is 13011102200101.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10100220111031 - 211 = 10100220108983 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10100220111061) 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, 5050110055515 + 5050110055516.

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

Almost surely, 210100220111031 is an apocalyptic number.

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

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

10100220111031 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 13.

Adding to 10100220111031 its reverse (13011102200101), we get a palindrome (23111322311132).

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