Search a number
-
+
110201121068957 is a prime number
BaseRepresentation
bin11001000011101000110010…
…101011001101011110011101
3112110012010100121022200002222
4121003220302223031132131
5103421013343443201312
61030213410210155125
732132524340430302
oct3103506253153635
9473163317280088
10110201121068957
113212803a9a7066
1210439870582aa5
134964bc893a139
141d2da96c870a9
15cb18b62d0672
hex643a32acd79d

110201121068957 has 2 divisors, whose sum is σ = 110201121068958. Its totient is φ = 110201121068956.

The previous prime is 110201121068923. The next prime is 110201121068959. The reversal of 110201121068957 is 759860121102011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 69980017544836 + 40221103524121 = 8365406^2 + 6342011^2 .

It is an emirp because it is prime and its reverse (759860121102011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 110201121068957 - 26 = 110201121068893 is a prime.

Together with 110201121068959, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2110201121068957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60480, while the sum is 44.

The spelling of 110201121068957 in words is "one hundred ten trillion, two hundred one billion, one hundred twenty-one million, sixty-eight thousand, nine hundred fifty-seven".