Search a number
-
+
130144444124399 is a prime number
BaseRepresentation
bin11101100101110110011101…
…010111001000110011101111
3122001210200120002010002002222
4131211312131113020303233
5114024241310143440044
61140443310544505555
736261424435412615
oct3545663527106357
9561720502102088
10130144444124399
1138516a48938851
121271aa4701b2bb
135780750a89093
14241d04bb0d6b5
15100a55051c8ee
hex765d9d5c8cef

130144444124399 has 2 divisors, whose sum is σ = 130144444124400. Its totient is φ = 130144444124398.

The previous prime is 130144444124323. The next prime is 130144444124423. The reversal of 130144444124399 is 993421444441031.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 130144444124399 - 28 = 130144444124143 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2130144444124399 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 5971968, while the sum is 53.

The spelling of 130144444124399 in words is "one hundred thirty trillion, one hundred forty-four billion, four hundred forty-four million, one hundred twenty-four thousand, three hundred ninety-nine".