Base | Representation |
---|---|
bin | 1001001011001011… |
… | …01101001101100000 |
3 | 110201021101212000120 |
4 | 10211211231031200 |
5 | 40041423440200 |
6 | 2132432520240 |
7 | 233026661340 |
oct | 44545551540 |
9 | 13637355016 |
10 | 4925608800 |
11 | 20a8417882 |
12 | b556b0080 |
13 | 606613428 |
14 | 34a258d20 |
15 | 1dc65e9a0 |
hex | 12596d360 |
4925608800 has 288 divisors, whose sum is σ = 18772798464. Its totient is φ = 1098240000.
The previous prime is 4925608729. The next prime is 4925608819. The reversal of 4925608800 is 88065294.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
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, 685225 + ... + 692375.
It is an arithmetic number, because the mean of its divisors is an integer number (65183328).
Almost surely, 24925608800 is an apocalyptic number.
4925608800 is a gapful number since it is divisible by the number (40) 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 4925608800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9386399232).
4925608800 is an abundant number, since it is smaller than the sum of its proper divisors (13847189664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4925608800 is a wasteful number, since it uses less digits than its factorization.
4925608800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7222 (or 7209 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 42.
The square root of 4925608800 is about 70182.6816244578. The cubic root of 4925608800 is about 1701.4530598477.
The spelling of 4925608800 in words is "four billion, nine hundred twenty-five million, six hundred eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •