Base | Representation |
---|---|
bin | 100100110100000011000… |
… | …0111100110010001110011 |
3 | 122220200122102100111001021 |
4 | 1021220012013212101303 |
5 | 1130344001434123104 |
6 | 14432200344520311 |
7 | 1031353651336531 |
oct | 111500607462163 |
9 | 18820572314037 |
10 | 5059574129779 |
11 | 1680831769a64 |
12 | 6986b5180097 |
13 | 2a9167522830 |
14 | 136c5585d151 |
15 | 8b9278a0754 |
hex | 49a061e6473 |
5059574129779 has 8 divisors (see below), whose sum is σ = 5448999102512. Its totient is φ = 4670181580320.
The previous prime is 5059574129741. The next prime is 5059574129791. The reversal of 5059574129779 is 9779214759505.
5059574129779 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 5059574129779 - 219 = 5059573605491 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5059574120779) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7781232 + ... + 8406349.
It is an arithmetic number, because the mean of its divisors is an integer number (681124887814).
Almost surely, 25059574129779 is an apocalyptic number.
5059574129779 is a deficient number, since it is larger than the sum of its proper divisors (389424972733).
5059574129779 is a wasteful number, since it uses less digits than its factorization.
5059574129779 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16211637.
The product of its (nonzero) digits is 250047000, while the sum is 70.
The spelling of 5059574129779 in words is "five trillion, fifty-nine billion, five hundred seventy-four million, one hundred twenty-nine thousand, seven hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •