Base | Representation |
---|---|
bin | 10010011101100010000… |
… | …11110010011010100000 |
3 | 2020122022121012222200110 |
4 | 21032301003302122200 |
5 | 40343102133041142 |
6 | 1203224005251320 |
7 | 63554210301651 |
oct | 11166103623240 |
9 | 2218277188613 |
10 | 634330752672 |
11 | 22502219a171 |
12 | a2b30103b40 |
13 | 47a8131b546 |
14 | 229b793d528 |
15 | 11778ca299c |
hex | 93b10f26a0 |
634330752672 has 192 divisors, whose sum is σ = 1768764211200. Its totient is φ = 198489553920.
The previous prime is 634330752661. The next prime is 634330752743. The reversal of 634330752672 is 276257033436.
It is a Harshad number since it is a multiple of its sum of digits (48).
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, 296276722 + ... + 296278862.
It is an arithmetic number, because the mean of its divisors is an integer number (9212313600).
Almost surely, 2634330752672 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 634330752672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (884382105600).
634330752672 is an abundant number, since it is smaller than the sum of its proper divisors (1134433458528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
634330752672 is a wasteful number, since it uses less digits than its factorization.
634330752672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3579 (or 3571 counting only the distinct ones).
The product of its (nonzero) digits is 3810240, while the sum is 48.
The spelling of 634330752672 in words is "six hundred thirty-four billion, three hundred thirty million, seven hundred fifty-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •