Search a number
-
+
110120232103153 is a prime number
BaseRepresentation
bin11001000010011101011101…
…010100010010110011110001
3112102220101120022110110021121
4121002131131110102303301
5103413202213404300103
61030112311455022241
732123632002524536
oct3102353524226361
9472811508413247
10110120232103153
11320a68012148a8
1210426056b0a981
13495a3a75a316c
141d29bc2024d8d
15cae72ec646bd
hex64275d512cf1

110120232103153 has 2 divisors, whose sum is σ = 110120232103154. Its totient is φ = 110120232103152.

The previous prime is 110120232103081. The next prime is 110120232103157. The reversal of 110120232103153 is 351301232021011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 66532864205824 + 43587367897329 = 8156768^2 + 6602073^2 .

It is a cyclic number.

It is not a de Polignac number, because 110120232103153 - 217 = 110120231972081 is a prime.

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

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

Almost surely, 2110120232103153 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 110120232103153 its reverse (351301232021011), we get a palindrome (461421464124164).

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