Search a number
-
+
1144402139989 is a prime number
BaseRepresentation
bin10000101001110011101…
…011101101101101010101
311001101220100112012001001
4100221303223231231111
5122222213421434424
62233421525303301
7145452231455503
oct20516353555525
94041810465031
101144402139989
1140137a19aa59
12165961b64b31
1383bbbb8c8a4
143d564589673
151eb7db95844
hex10a73aedb55

1144402139989 has 2 divisors, whose sum is σ = 1144402139990. Its totient is φ = 1144402139988.

The previous prime is 1144402139987. The next prime is 1144402140029. The reversal of 1144402139989 is 9899312044411.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1094237339364 + 50164800625 = 1046058^2 + 223975^2 .

It is a cyclic number.

It is not a de Polignac number, because 1144402139989 - 21 = 1144402139987 is a prime.

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

Together with 1144402139987, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1144402139987) 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, 572201069994 + 572201069995.

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

Almost surely, 21144402139989 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2239488, while the sum is 55.

The spelling of 1144402139989 in words is "one trillion, one hundred forty-four billion, four hundred two million, one hundred thirty-nine thousand, nine hundred eighty-nine".