Search a number
-
+
1120144912157 is a prime number
BaseRepresentation
bin10000010011001101110…
…101101110111100011101
310222002021211021100002102
4100103031311232330131
5121323024044142112
62214330520534445
7143633143440605
oct20231565567435
93862254240072
101120144912157
113a2061667727
12161112321425
13818244c003b
143c302b11c05
151e20e2e3bc2
hex104cdd6ef1d

1120144912157 has 2 divisors, whose sum is σ = 1120144912158. Its totient is φ = 1120144912156.

The previous prime is 1120144912141. The next prime is 1120144912199. The reversal of 1120144912157 is 7512194410211.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1077653686201 + 42491225956 = 1038101^2 + 206134^2 .

It is a cyclic number.

It is not a de Polignac number, because 1120144912157 - 24 = 1120144912141 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1120144912157.

It is a congruent number.

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

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

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

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

Almost surely, 21120144912157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20160, while the sum is 38.

The spelling of 1120144912157 in words is "one trillion, one hundred twenty billion, one hundred forty-four million, nine hundred twelve thousand, one hundred fifty-seven".