Base | Representation |
---|---|
bin | 100101100101100… |
… | …001110111110000 |
3 | 1121221120112210110 |
4 | 211211201313300 |
5 | 2242413020211 |
6 | 142323501320 |
7 | 21424653360 |
oct | 4545416760 |
9 | 1557515713 |
10 | 630595056 |
11 | 2a3a55443 |
12 | 157227840 |
13 | a084b690 |
14 | 5da6c9a0 |
15 | 3a562ea6 |
hex | 25961df0 |
630595056 has 160 divisors (see below), whose sum is σ = 2070089728. Its totient is φ = 160911360.
The previous prime is 630595037. The next prime is 630595061. The reversal of 630595056 is 650595036.
630595056 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 (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 133080 + ... + 137736.
Almost surely, 2630595056 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 630595056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1035044864).
630595056 is an abundant number, since it is smaller than the sum of its proper divisors (1439494672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630595056 is a wasteful number, since it uses less digits than its factorization.
630595056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4719 (or 4713 counting only the distinct ones).
The product of its (nonzero) digits is 121500, while the sum is 39.
The square root of 630595056 is about 25111.6517975222. The cubic root of 630595056 is about 857.5317074410.
It can be divided in two parts, 630 and 595056, that added together give a triangular number (595686 = T1091).
The spelling of 630595056 in words is "six hundred thirty million, five hundred ninety-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •