Base | Representation |
---|---|
bin | 10010010110101100110… |
… | …11001000001110111000 |
3 | 2020021211222001121221010 |
4 | 21023112123020032320 |
5 | 40313044120123143 |
6 | 1201420013313520 |
7 | 63364260112200 |
oct | 11132633101670 |
9 | 2207758047833 |
10 | 630662661048 |
11 | 22350a6a3692 |
12 | a22877958a0 |
13 | 476183ba424 |
14 | 2274a707400 |
15 | 11611c40a33 |
hex | 92d66c83b8 |
630662661048 has 384 divisors, whose sum is σ = 1976223744000. Its totient is φ = 166842224640.
The previous prime is 630662661011. The next prime is 630662661053. The reversal of 630662661048 is 840166266036.
It is a junction number, because it is equal to n+sod(n) for n = 630662660988 and 630662661006.
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 95 ways as a sum of consecutive naturals, for example, 119463673 + ... + 119468951.
It is an arithmetic number, because the mean of its divisors is an integer number (5146416000).
Almost surely, 2630662661048 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 630662661048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (988111872000).
630662661048 is an abundant number, since it is smaller than the sum of its proper divisors (1345561082952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630662661048 is a wasteful number, since it uses less digits than its factorization.
630662661048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5475 (or 5464 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 48.
The spelling of 630662661048 in words is "six hundred thirty billion, six hundred sixty-two million, six hundred sixty-one thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •