Search a number
-
+
110001102221077 is a prime number
BaseRepresentation
bin11001000000101110100000…
…100111110110111100010101
3112102111000001221120102011221
4121000232200213312330111
5103404224224132033302
61025541450404130341
732112213600323224
oct3100564047667425
9472430057512157
10110001102221077
1132060229532201
1210406b4a6969b1
13494c0a074c092
141d2412049acbb
15cab5ab386937
hex640ba09f6f15

110001102221077 has 2 divisors, whose sum is σ = 110001102221078. Its totient is φ = 110001102221076.

The previous prime is 110001102221009. The next prime is 110001102221081. The reversal of 110001102221077 is 770122201100011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 89195954698321 + 20805147522756 = 9444361^2 + 4561266^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2110001102221077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 392, while the sum is 25.

Adding to 110001102221077 its reverse (770122201100011), we get a palindrome (880123303321088).

The spelling of 110001102221077 in words is "one hundred ten trillion, one billion, one hundred two million, two hundred twenty-one thousand, seventy-seven".