Search a number
-
+
100102220201101 is a prime number
BaseRepresentation
bin10110110000101011011101…
…010001101011110010001101
3111010102200022211122202212211
4112300223131101223302031
5101110033321332413401
6552522154120230421
730041101222414246
oct2660533521536215
9433380284582784
10100102220201101
112999412770a218
12b28859300b411
1343b17a290ab41
141aa0d8aa8bccd
15b88d4d8b6951
hex5b0add46bc8d

100102220201101 has 2 divisors, whose sum is σ = 100102220201102. Its totient is φ = 100102220201100.

The previous prime is 100102220201069. The next prime is 100102220201107. The reversal of 100102220201101 is 101102022201001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 98470791330025 + 1631428871076 = 9923245^2 + 1277274^2 .

It is a cyclic number.

It is not a de Polignac number, because 100102220201101 - 25 = 100102220201069 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2100102220201101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 100102220201101 its reverse (101102022201001), we get a palindrome (201204242402102).

The spelling of 100102220201101 in words is "one hundred trillion, one hundred two billion, two hundred twenty million, two hundred one thousand, one hundred one".