Search a number
-
+
15052155514391 is a prime number
BaseRepresentation
bin1101101100001001101001…
…1000011110111000010111
31222021222020121011000201202
43123002122120132320113
53433103303302430031
652002510443143115
73112324305561632
oct333023230367027
958258217130652
1015052155514391
114883646419486
121831260514a9b
138525487166b8
143a07575c2c19
151b181b38a2cb
hexdb09a61ee17

15052155514391 has 2 divisors, whose sum is σ = 15052155514392. Its totient is φ = 15052155514390.

The previous prime is 15052155514289. The next prime is 15052155514433. The reversal of 15052155514391 is 19341555125051.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15052155514391 is a prime.

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

It is a congruent number.

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

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

Almost surely, 215052155514391 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 675000, while the sum is 47.

The spelling of 15052155514391 in words is "fifteen trillion, fifty-two billion, one hundred fifty-five million, five hundred fourteen thousand, three hundred ninety-one".