Search a number
-
+
110130133200229 is a prime number
BaseRepresentation
bin11001000010100110101011…
…011101111110110101100101
3112102221100010100010022002201
4121002212223131332311211
5103413333003044401404
61030121030145534501
732124432236464012
oct3102465335766545
9472840110108081
10110130133200229
11320aaa2211765a
1210427b5a944431
13495b2c494229c
141d2a480da0709
15caeb0e0d7ca4
hex6429ab77ed65

110130133200229 has 2 divisors, whose sum is σ = 110130133200230. Its totient is φ = 110130133200228.

The previous prime is 110130133200193. The next prime is 110130133200253. The reversal of 110130133200229 is 922002331031011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 74831063745025 + 35299069455204 = 8650495^2 + 5941302^2 .

It is a cyclic number.

It is not a de Polignac number, because 110130133200229 - 227 = 110129998982501 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 110130133200197 and 110130133200206.

It is a congruent number.

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

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

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

Almost surely, 2110130133200229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1944, while the sum is 28.

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