Base | Representation |
---|---|
bin | 101000101100100011110… |
… | …1111000001011001101111 |
3 | 201210201011021101210221122 |
4 | 1101121013233001121233 |
5 | 1213114434214200424 |
6 | 15521300510451155 |
7 | 1115045654310122 |
oct | 121310757013157 |
9 | 21721137353848 |
10 | 5593250928239 |
11 | 18670a23735a7 |
12 | 764014503abb |
13 | 3175976c4890 |
14 | 154a0154c3b9 |
15 | 9a75ecde45e |
hex | 51647bc166f |
5593250928239 has 4 divisors (see below), whose sum is σ = 6023500999656. Its totient is φ = 5163000856824.
The previous prime is 5593250928173. The next prime is 5593250928281. The reversal of 5593250928239 is 9328290523955.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5593250928239 - 28 = 5593250927983 is a prime.
It is a super-2 number, since 2×55932509282392 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5593250928739) 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 in 3 ways as a sum of consecutive naturals, for example, 215125035689 + ... + 215125035714.
It is an arithmetic number, because the mean of its divisors is an integer number (1505875249914).
Almost surely, 25593250928239 is an apocalyptic number.
5593250928239 is a deficient number, since it is larger than the sum of its proper divisors (430250071417).
5593250928239 is a wasteful number, since it uses less digits than its factorization.
5593250928239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430250071416.
The product of its (nonzero) digits is 52488000, while the sum is 62.
The spelling of 5593250928239 in words is "five trillion, five hundred ninety-three billion, two hundred fifty million, nine hundred twenty-eight thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •