Base | Representation |
---|---|
bin | 10010010111000101101… |
… | …01101000100111000000 |
3 | 2020022101110222002110020 |
4 | 21023202311220213000 |
5 | 40314010424423000 |
6 | 1201452413333440 |
7 | 63402366322614 |
oct | 11134265504700 |
9 | 2208343862406 |
10 | 630870936000 |
11 | 223607218748 |
12 | a2325497280 |
13 | 4764c5b1046 |
14 | 2276a241344 |
15 | 11625181ba0 |
hex | 92e2d689c0 |
630870936000 has 224 divisors, whose sum is σ = 2133947350080. Its totient is φ = 164128768000.
The previous prime is 630870935963. The next prime is 630870936079. The reversal of 630870936000 is 639078036.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 663436 + ... + 1304564.
It is an arithmetic number, because the mean of its divisors is an integer number (9526550670).
Almost surely, 2630870936000 is an apocalyptic number.
630870936000 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 630870936000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1066973675040).
630870936000 is an abundant number, since it is smaller than the sum of its proper divisors (1503076414080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630870936000 is a wasteful number, since it uses less digits than its factorization.
630870936000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 641200 (or 641180 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 42.
The spelling of 630870936000 in words is "six hundred thirty billion, eight hundred seventy million, nine hundred thirty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •