Base | Representation |
---|---|
bin | 100101011111000… |
… | …101010011110000 |
3 | 1121211101200202012 |
4 | 211133011103300 |
5 | 2241444431300 |
6 | 142223342052 |
7 | 21404414600 |
oct | 4537052360 |
9 | 1554350665 |
10 | 628905200 |
11 | 2a3000870 |
12 | 156751928 |
13 | a03a9471 |
14 | 5d74cc00 |
15 | 3a32c435 |
hex | 257c54f0 |
628905200 has 180 divisors, whose sum is σ = 1918071432. Its totient is φ = 195955200.
The previous prime is 628905197. The next prime is 628905203. The reversal of 628905200 is 2509826.
628905200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (628905197) and next prime (628905203).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (628905203) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 214142 + ... + 217058.
Almost surely, 2628905200 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 628905200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (959035716).
628905200 is an abundant number, since it is smaller than the sum of its proper divisors (1289166232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
628905200 is a wasteful number, since it uses less digits than its factorization.
628905200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2960 (or 2942 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 32.
The square root of 628905200 is about 25077.9823749838. The cubic root of 628905200 is about 856.7650234202.
The spelling of 628905200 in words is "six hundred twenty-eight million, nine hundred five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •