Base | Representation |
---|---|
bin | 1100011100110100… |
… | …01111001100100000 |
3 | 122020211112001021120 |
4 | 12032122033030200 |
5 | 102142124204302 |
6 | 3023133452240 |
7 | 324432563400 |
oct | 61632171440 |
9 | 18224461246 |
10 | 6684209952 |
11 | 2920075962 |
12 | 1366641080 |
13 | 826a6a024 |
14 | 475a36800 |
15 | 291c3b9bc |
hex | 18e68f320 |
6684209952 has 144 divisors (see below), whose sum is σ = 21298479552. Its totient is φ = 1826711040.
The previous prime is 6684209947. The next prime is 6684209953. The reversal of 6684209952 is 2599024866.
It is a junction number, because it is equal to n+sod(n) for n = 6684209895 and 6684209904.
It is not an unprimeable number, because it can be changed into a prime (6684209953) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 77302 + ... + 139082.
It is an arithmetic number, because the mean of its divisors is an integer number (147906108).
Almost surely, 26684209952 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 6684209952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10649239776).
6684209952 is an abundant number, since it is smaller than the sum of its proper divisors (14614269600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6684209952 is a wasteful number, since it uses less digits than its factorization.
6684209952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61831 (or 61816 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 51.
The square root of 6684209952 is about 81757.0177538295. The cubic root of 6684209952 is about 1883.7214981332.
The spelling of 6684209952 in words is "six billion, six hundred eighty-four million, two hundred nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •