Search a number
-
+
1539240015539 is a prime number
BaseRepresentation
bin10110011001100001110…
…110101011011010110011
312110011001021122110112102
4112121201312223122303
5200204330420444124
63135041143251015
7216130542154142
oct26314166533263
95404037573472
101539240015539
115438739518a6
1220a394449a6b
13b21c3bb6905
14546dcd27759
152a08c2b0aae
hex16661dab6b3

1539240015539 has 2 divisors, whose sum is σ = 1539240015540. Its totient is φ = 1539240015538.

The previous prime is 1539240015517. The next prime is 1539240015587. The reversal of 1539240015539 is 9355100429351.

It is a weak prime.

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

It is a cyclic number.

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

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

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

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

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

Almost surely, 21539240015539 is an apocalyptic number.

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

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

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

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

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