Search a number
-
+
15151320139 is a prime number
BaseRepresentation
bin11100001110001011…
…01100110001001011
31110002220212210220011
432013011230301023
5222012214221024
610543241212351
71044315045004
oct160705546113
943086783804
1015151320139
11647558608a
122b2a1910b7
131575cbaab7
14a3a3741ab
155da255094
hex38716cc4b

15151320139 has 2 divisors, whose sum is σ = 15151320140. Its totient is φ = 15151320138.

The previous prime is 15151320137. The next prime is 15151320167. The reversal of 15151320139 is 93102315151.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 15151320139 - 21 = 15151320137 is a prime.

Together with 15151320137, it forms a pair of twin primes.

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

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

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

Almost surely, 215151320139 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4050, while the sum is 31.

The spelling of 15151320139 in words is "fifteen billion, one hundred fifty-one million, three hundred twenty thousand, one hundred thirty-nine".