Base | Representation |
---|---|
bin | 1001011100011100… |
… | …11000100000000000 |
3 | 111002101000120010010 |
4 | 10232032120200000 |
5 | 40341021131400 |
6 | 2155050104520 |
7 | 236436310341 |
oct | 45616304000 |
9 | 14071016103 |
10 | 5070489600 |
11 | 2172182980 |
12 | b9611b140 |
13 | 62a63c207 |
14 | 3615b00c8 |
15 | 1ea22c450 |
hex | 12e398800 |
5070489600 has 288 divisors, whose sum is σ = 18292266720. Its totient is φ = 1228800000.
The previous prime is 5070489563. The next prime is 5070489617. The reversal of 5070489600 is 69840705.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1688100 + ... + 1691100.
It is an arithmetic number, because the mean of its divisors is an integer number (63514815).
Almost surely, 25070489600 is an apocalyptic number.
5070489600 is a gapful number since it is divisible by the number (50) 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 5070489600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9146133360).
5070489600 is an abundant number, since it is smaller than the sum of its proper divisors (13221777120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5070489600 is a wasteful number, since it uses less digits than its factorization.
5070489600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3047 (or 3022 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 39.
The square root of 5070489600 is about 71207.3704050360. The cubic root of 5070489600 is about 1717.9741788269.
The spelling of 5070489600 in words is "five billion, seventy million, four hundred eighty-nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •