Base | Representation |
---|---|
bin | 1001011011000111… |
… | …10110111100100000 |
3 | 111001121001012122012 |
4 | 10231203312330200 |
5 | 40330142421422 |
6 | 2154011132052 |
7 | 236242461356 |
oct | 45543667440 |
9 | 14047035565 |
10 | 5059342112 |
11 | 2166959680 |
12 | b92444028 |
13 | 628238276 |
14 | 35dd0b7d6 |
15 | 1e92794e2 |
hex | 12d8f6f20 |
5059342112 has 72 divisors (see below), whose sum is σ = 11168766000. Its totient is φ = 2237333760.
The previous prime is 5059342109. The next prime is 5059342139. The reversal of 5059342112 is 2112439505.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 476639 + ... + 487137.
It is an arithmetic number, because the mean of its divisors is an integer number (155121750).
Almost surely, 25059342112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5059342112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5584383000).
5059342112 is an abundant number, since it is smaller than the sum of its proper divisors (6109423888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5059342112 is a wasteful number, since it uses less digits than its factorization.
5059342112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10594 (or 10549 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
The square root of 5059342112 is about 71129.0525172380. The cubic root of 5059342112 is about 1716.7142644462.
The spelling of 5059342112 in words is "five billion, fifty-nine million, three hundred forty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •