Base | Representation |
---|---|
bin | 100100110011111001011… |
… | …1101111110001110111111 |
3 | 122220122211000210020110002 |
4 | 1021213302331332032333 |
5 | 1130342322211324414 |
6 | 14432104430304515 |
7 | 1031343000405005 |
oct | 111476275761677 |
9 | 18818730706402 |
10 | 5059252839359 |
11 | 1680687373794 |
12 | 69862565813b |
13 | 2a9115aac164 |
14 | 136c24d06a75 |
15 | 8b9095884de |
hex | 499f2f7e3bf |
5059252839359 has 8 divisors (see below), whose sum is σ = 5060376888672. Its totient is φ = 5058128918880.
The previous prime is 5059252839331. The next prime is 5059252839391. The reversal of 5059252839359 is 9539382529505.
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 5059252839359 - 240 = 3959741211583 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5059252839295 and 5059252839304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5059252839559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130303169 + ... + 130341989.
It is an arithmetic number, because the mean of its divisors is an integer number (632547111084).
Almost surely, 25059252839359 is an apocalyptic number.
5059252839359 is a deficient number, since it is larger than the sum of its proper divisors (1124049313).
5059252839359 is a wasteful number, since it uses less digits than its factorization.
5059252839359 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64417.
The product of its (nonzero) digits is 131220000, while the sum is 65.
The spelling of 5059252839359 in words is "five trillion, fifty-nine billion, two hundred fifty-two million, eight hundred thirty-nine thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •