Search a number
-
+
15140122145033 is a prime number
BaseRepresentation
bin1101110001010001010110…
…0110100011000100001001
31222121101022010212212110212
43130110111212203010021
53441023432232120113
652111135345250505
73121560224602634
oct334242546430411
958541263785425
1015140122145033
114907987281026
121846310333a35
1385a9271a9b32
143a4b0041ac1b
151b3c68e620a8
hexdc5159a3109

15140122145033 has 2 divisors, whose sum is σ = 15140122145034. Its totient is φ = 15140122145032.

The previous prime is 15140122145011. The next prime is 15140122145051. The reversal of 15140122145033 is 33054122104151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13101772011769 + 2038350133264 = 3619637^2 + 1427708^2 .

It is a cyclic number.

It is not a de Polignac number, because 15140122145033 - 222 = 15140117950729 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 215140122145033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14400, while the sum is 32.

Adding to 15140122145033 its reverse (33054122104151), we get a palindrome (48194244249184).

The spelling of 15140122145033 in words is "fifteen trillion, one hundred forty billion, one hundred twenty-two million, one hundred forty-five thousand, thirty-three".