Search a number
-
+
15141450239 is a prime number
BaseRepresentation
bin11100001101000000…
…00011000111111111
31110002020022100221022
432012200003013333
5222002202401424
610542245454355
71044135126536
oct160640030777
943066270838
1015141450239
11646aa54743
122b26a113bb
131573c43516
14a38d2531d
155d945595e
hex3868031ff

15141450239 has 2 divisors, whose sum is σ = 15141450240. Its totient is φ = 15141450238.

The previous prime is 15141450223. The next prime is 15141450241. The reversal of 15141450239 is 93205414151.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 15141450239 - 24 = 15141450223 is a prime.

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

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

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 215141450239 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 21600, while the sum is 35.

The spelling of 15141450239 in words is "fifteen billion, one hundred forty-one million, four hundred fifty thousand, two hundred thirty-nine".