Base | Representation |
---|---|
bin | 100100110011111011101… |
… | …1100001010100011010000 |
3 | 122220200000020221211112011 |
4 | 1021213313130022203100 |
5 | 1130343000413103432 |
6 | 14432120110312304 |
7 | 1031344601163544 |
oct | 111476734124320 |
9 | 18820006854464 |
10 | 5059327862992 |
11 | 1680715756097 |
12 | 6986467b8694 |
13 | 2a91284b9440 |
14 | 136c30c75a24 |
15 | 8b910e57847 |
hex | 499f770a8d0 |
5059327862992 has 80 divisors (see below), whose sum is σ = 10692411197440. Its totient is φ = 2305019897856.
The previous prime is 5059327862989. The next prime is 5059327863049. The reversal of 5059327862992 is 2992687239505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 82507288 + ... + 82568584.
It is an arithmetic number, because the mean of its divisors is an integer number (133655139968).
Almost surely, 25059327862992 is an apocalyptic number.
5059327862992 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5059327862992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5346205598720).
5059327862992 is an abundant number, since it is smaller than the sum of its proper divisors (5633083334448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5059327862992 is a wasteful number, since it uses less digits than its factorization.
5059327862992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66420 (or 66414 counting only the distinct ones).
The product of its (nonzero) digits is 146966400, while the sum is 67.
The spelling of 5059327862992 in words is "five trillion, fifty-nine billion, three hundred twenty-seven million, eight hundred sixty-two thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •