Search a number
-
+
110001111002147 is a prime number
BaseRepresentation
bin11001000000101110100001…
…001001010110110000100011
3112102111000002120002112112202
4121000232201021112300203
5103404224233404032042
61025541451320243415
732112214035055061
oct3100564111266043
9472430076075482
10110001111002147
113206023348a592
1210406b5161056b
13494c0a2504b91
141d24121705031
15cab5ac01d632
hex640ba1256c23

110001111002147 has 2 divisors, whose sum is σ = 110001111002148. Its totient is φ = 110001111002146.

The previous prime is 110001111002113. The next prime is 110001111002197. The reversal of 110001111002147 is 741200111100011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 110001111002147 - 238 = 109726233095203 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2110001111002147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 56, while the sum is 20.

Adding to 110001111002147 its reverse (741200111100011), we get a palindrome (851201222102158).

The spelling of 110001111002147 in words is "one hundred ten trillion, one billion, one hundred eleven million, two thousand, one hundred forty-seven".