Search a number
-
+
539056650241 = 1515936020087
BaseRepresentation
bin1111101100000100100…
…01111011100000000001
31220112101210012010011001
413312002101323200001
532312442000301431
61051350022452001
753642216632324
oct7660221734001
91815353163131
10539056650241
1119868147593a
1288580b94001
133baa99394c5
141c13a3cc7bb
15e04e8c8e61
hex7d8247b801

539056650241 has 8 divisors (see below), whose sum is σ = 543541705344. Its totient is φ = 534583636800.

The previous prime is 539056650239. The next prime is 539056650247. The reversal of 539056650241 is 142056650935.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 539056650241 - 21 = 539056650239 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (539056650247) 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 in 7 ways as a sum of consecutive naturals, for example, 2920501 + ... + 3099586.

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

Almost surely, 2539056650241 is an apocalyptic number.

It is an amenable number.

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

539056650241 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 6020831.

The product of its (nonzero) digits is 972000, while the sum is 46.

The spelling of 539056650241 in words is "five hundred thirty-nine billion, fifty-six million, six hundred fifty thousand, two hundred forty-one".

Divisors: 1 151 593 89543 6020087 909033137 3569911591 539056650241