Base | Representation |
---|---|
bin | 100101100101111… |
… | …101110001001000 |
3 | 1121221210100112110 |
4 | 211211331301020 |
5 | 2242430144240 |
6 | 142330142320 |
7 | 21425640453 |
oct | 4545756110 |
9 | 1557710473 |
10 | 630709320 |
11 | 2a402327a |
12 | 1572819a0 |
13 | a088b6a7 |
14 | 5da9c49a |
15 | 3a586c80 |
hex | 2597dc48 |
630709320 has 32 divisors (see below), whose sum is σ = 1892128320. Its totient is φ = 168189120.
The previous prime is 630709307. The next prime is 630709361. The reversal of 630709320 is 23907036.
It is a happy number.
630709320 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 an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2627836 + ... + 2628075.
It is an arithmetic number, because the mean of its divisors is an integer number (59129010).
Almost surely, 2630709320 is an apocalyptic number.
630709320 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
630709320 is an abundant number, since it is smaller than the sum of its proper divisors (1261419000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630709320 is a wasteful number, since it uses less digits than its factorization.
630709320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5255925 (or 5255921 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 30.
The square root of 630709320 is about 25113.9268136228. The cubic root of 630709320 is about 857.5834993078.
It can be divided in two parts, 63070 and 9320, that added together give a triangular number (72390 = T380).
The spelling of 630709320 in words is "six hundred thirty million, seven hundred nine thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •