Search a number
-
+
110101056127 is a prime number
BaseRepresentation
bin110011010001010001…
…0001100101001111111
3101112012010120011022121
41212202202030221333
53300441332244002
6122325115423411
710645256351506
oct1464242145177
9345163504277
10110101056127
114276a1a3077
1219408754b67
13a4c842032a
1454867ab83d
152ce5e0a237
hex19a288ca7f

110101056127 has 2 divisors, whose sum is σ = 110101056128. Its totient is φ = 110101056126.

The previous prime is 110101056073. The next prime is 110101056157. The reversal of 110101056127 is 721650101011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110101056127 - 211 = 110101054079 is a prime.

It is a congruent number.

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

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

Almost surely, 2110101056127 is an apocalyptic number.

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

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

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

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

Adding to 110101056127 its reverse (721650101011), we get a palindrome (831751157138).

The spelling of 110101056127 in words is "one hundred ten billion, one hundred one million, fifty-six thousand, one hundred twenty-seven".