Base | Representation |
---|---|
bin | 1001100010110001… |
… | …00110101100000000 |
3 | 111020001202210210220 |
4 | 10301120212230000 |
5 | 40443104011200 |
6 | 2204222223040 |
7 | 240652016055 |
oct | 46130465400 |
9 | 14201683726 |
10 | 5123500800 |
11 | 219a09aa90 |
12 | baba24a80 |
13 | 6386100a2 |
14 | 36864d02c |
15 | 1eebee4a0 |
hex | 131626b00 |
5123500800 has 432 divisors, whose sum is σ = 19544499072. Its totient is φ = 1168179200.
The previous prime is 5123500799. The next prime is 5123500813. The reversal of 5123500800 is 80053215.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3589687 + ... + 3591113.
It is an arithmetic number, because the mean of its divisors is an integer number (45241896).
Almost surely, 25123500800 is an apocalyptic number.
5123500800 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 5123500800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9772249536).
5123500800 is an abundant number, since it is smaller than the sum of its proper divisors (14420998272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5123500800 is a wasteful number, since it uses less digits than its factorization.
5123500800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1484 (or 1465 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 5123500800 is about 71578.6336835232. The cubic root of 5123500800 is about 1723.9404877866.
The spelling of 5123500800 in words is "five billion, one hundred twenty-three million, five hundred thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •