Search a number
-
+
110230221030133 is a prime number
BaseRepresentation
bin11001000100000011111001…
…001010110000001011110101
3112110021220110122000212022211
4121010003321022300023311
5103422002443040431013
61030235021531253421
732134604431136251
oct3104037112601365
9473256418025284
10110230221030133
1132139413091656
1210443431baa271
1349678856c3c89
141d31257965261
15cb251adc123d
hex6440f92b02f5

110230221030133 has 2 divisors, whose sum is σ = 110230221030134. Its totient is φ = 110230221030132.

The previous prime is 110230221030113. The next prime is 110230221030169. The reversal of 110230221030133 is 331030122032011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 86981401209924 + 23248819820209 = 9326382^2 + 4821703^2 .

It is a cyclic number.

It is not a de Polignac number, because 110230221030133 - 241 = 108031197774581 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2110230221030133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 22.

Adding to 110230221030133 its reverse (331030122032011), we get a palindrome (441260343062144).

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