Search a number
-
+
110000121333181 is a prime number
BaseRepresentation
bin11001000000101101100110…
…001010000100010110111101
3112102110220112120212010221121
4121000231212022010112331
5103404220222030130211
61025541205204230541
732112150360032602
oct3100554612042675
9472426476763847
10110000121333181
113205a875882652
121040691609b451
13494bc75474141
141d2406a0c66a9
15cab5501cd271
hex640b662845bd

110000121333181 has 2 divisors, whose sum is σ = 110000121333182. Its totient is φ = 110000121333180.

The previous prime is 110000121333169. The next prime is 110000121333239. The reversal of 110000121333181 is 181333121000011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 92210579737956 + 17789541595225 = 9602634^2 + 4217765^2 .

It is a cyclic number.

It is not a de Polignac number, because 110000121333181 - 25 = 110000121333149 is a prime.

It is a super-2 number, since 2×1100001213331812 (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 (110000121333121) by changing a digit.

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

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

Almost surely, 2110000121333181 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 110000121333181 its reverse (181333121000011), we get a palindrome (291333242333192).

The spelling of 110000121333181 in words is "one hundred ten trillion, one hundred twenty-one million, three hundred thirty-three thousand, one hundred eighty-one".