Base | Representation |
---|---|
bin | 100101100101001… |
… | …110110101011000 |
3 | 1121221102120211110 |
4 | 211211032311120 |
5 | 2242403021310 |
6 | 142322100320 |
7 | 21424210134 |
oct | 4545166530 |
9 | 1557376743 |
10 | 630517080 |
11 | 2a3a018a6 |
12 | 1571aa6a0 |
13 | a082203b |
14 | 5da4c3c4 |
15 | 3a549d20 |
hex | 2594ed58 |
630517080 has 96 divisors (see below), whose sum is σ = 2009474640. Its totient is φ = 158238720.
The previous prime is 630517057. The next prime is 630517093. The reversal of 630517080 is 80715036.
630517080 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25590 + ... + 43770.
Almost surely, 2630517080 is an apocalyptic number.
630517080 is a gapful number since it is divisible by the number (60) 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 630517080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1004737320).
630517080 is an abundant number, since it is smaller than the sum of its proper divisors (1378957560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630517080 is a wasteful number, since it uses less digits than its factorization.
630517080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18229 (or 18208 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 630517080 is about 25110.0991634840. The cubic root of 630517080 is about 857.4963600613.
The spelling of 630517080 in words is "six hundred thirty million, five hundred seventeen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •