Search a number
-
+
15052557539 is a prime number
BaseRepresentation
bin11100000010011001…
…11100110011100011
31102212001001011002002
432001030330303203
5221311423320124
610525352314215
71042005425255
oct160114746343
942761034062
1015052557539
11642485a2a8
122b010a296b
13155b6bb5a6
14a2b1c5cd5
155d17470ae
hex38133cce3

15052557539 has 2 divisors, whose sum is σ = 15052557540. Its totient is φ = 15052557538.

The previous prime is 15052557521. The next prime is 15052557593. The reversal of 15052557539 is 93575525051.

15052557539 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

Together with next prime (15052557593) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is an emirp because it is prime and its reverse (93575525051) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 15052557539 - 220 = 15051508963 is a prime.

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

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

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

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

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

Almost surely, 215052557539 is an apocalyptic number.

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

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

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

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

The spelling of 15052557539 in words is "fifteen billion, fifty-two million, five hundred fifty-seven thousand, five hundred thirty-nine".