Search a number
-
+
10144514040139 is a prime number
BaseRepresentation
bin1001001110011111010000…
…1001111110000101001011
31022220210202121220010112101
42103213310021332011023
52312201431043241024
633324154142254231
72064626341411423
oct223476411760513
938823677803471
1010144514040139
11326129a788346
12117a0a9287377
13587814c9b78b
14270dd607d483
15128d370c7c44
hex939f427e14b

10144514040139 has 2 divisors, whose sum is σ = 10144514040140. Its totient is φ = 10144514040138.

The previous prime is 10144514040097. The next prime is 10144514040163. The reversal of 10144514040139 is 93104041544101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10144514040139 - 225 = 10144480485707 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10144514040098 and 10144514040107.

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

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

Almost surely, 210144514040139 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 34560, while the sum is 37.

The spelling of 10144514040139 in words is "ten trillion, one hundred forty-four billion, five hundred fourteen million, forty thousand, one hundred thirty-nine".