Base | Representation |
---|---|
bin | 1100110110000111… |
… | …01001100110100000 |
3 | 122210121210001011110 |
4 | 12123003221212200 |
5 | 103110434030413 |
6 | 3100153343320 |
7 | 332620240620 |
oct | 63303514640 |
9 | 18717701143 |
10 | 6896392608 |
11 | 2a19919926 |
12 | 1405707b40 |
13 | 85b9cb4b1 |
14 | 495caa880 |
15 | 2a56a08c3 |
hex | 19b0e99a0 |
6896392608 has 192 divisors, whose sum is σ = 21954723840. Its totient is φ = 1851558912.
The previous prime is 6896392571. The next prime is 6896392609. The reversal of 6896392608 is 8062936986.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (6896392609) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1619410 + ... + 1623662.
It is an arithmetic number, because the mean of its divisors is an integer number (114347520).
Almost surely, 26896392608 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 6896392608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10977361920).
6896392608 is an abundant number, since it is smaller than the sum of its proper divisors (15058331232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6896392608 is a wasteful number, since it uses less digits than its factorization.
6896392608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4419 (or 4411 counting only the distinct ones).
The product of its (nonzero) digits is 6718464, while the sum is 57.
The square root of 6896392608 is about 83044.5218422022. The cubic root of 6896392608 is about 1903.4464324150.
The spelling of 6896392608 in words is "six billion, eight hundred ninety-six million, three hundred ninety-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •