Search a number
-
+
110034033300181 is a prime number
BaseRepresentation
bin11001000001001101001011…
…011101111101001011010101
3112102121011001222012120012101
4121001031023131331023111
5103410244200011101211
61030004534223322101
732114460631014214
oct3101151335751325
9472534058176171
10110034033300181
1132073198242361
12104113bb150331
13495221b1470c3
141d25965ccb07b
15cac38748d5c1
hex64134b77d2d5

110034033300181 has 2 divisors, whose sum is σ = 110034033300182. Its totient is φ = 110034033300180.

The previous prime is 110034033300173. The next prime is 110034033300287. The reversal of 110034033300181 is 181003330430011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 107759866755025 + 2274166545156 = 10380745^2 + 1508034^2 .

It is a cyclic number.

It is not a de Polignac number, because 110034033300181 - 23 = 110034033300173 is a prime.

It is a super-2 number, since 2×1100340333001812 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 2110034033300181 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 110034033300181 its reverse (181003330430011), we get a palindrome (291037363730192).

The spelling of 110034033300181 in words is "one hundred ten trillion, thirty-four billion, thirty-three million, three hundred thousand, one hundred eighty-one".