Base | Representation |
---|---|
bin | 100101100011111… |
… | …000111111111100 |
3 | 1121220202201112222 |
4 | 211203320333330 |
5 | 2242310244000 |
6 | 142310344512 |
7 | 21421214126 |
oct | 4543707774 |
9 | 1556681488 |
10 | 630165500 |
11 | 2a3791738 |
12 | 15705b138 |
13 | a072acc3 |
14 | 5d99a216 |
15 | 3a4caa85 |
hex | 258f8ffc |
630165500 has 96 divisors (see below), whose sum is σ = 1475929728. Its totient is φ = 234432000.
The previous prime is 630165499. The next prime is 630165517. The reversal of 630165500 is 5561036.
It is a self number, because there is not a number n which added to its sum of digits gives 630165500.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 424760 + ... + 426240.
It is an arithmetic number, because the mean of its divisors is an integer number (15374268).
Almost surely, 2630165500 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 630165500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (737964864).
630165500 is an abundant number, since it is smaller than the sum of its proper divisors (845764228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630165500 is a wasteful number, since it uses less digits than its factorization.
630165500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1560 (or 1548 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 630165500 is about 25103.0974184462. The cubic root of 630165500 is about 857.3369487714.
The spelling of 630165500 in words is "six hundred thirty million, one hundred sixty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •