Base | Representation |
---|---|
bin | 1100011101001000… |
… | …00110100100010000 |
3 | 122021000101102201220 |
4 | 12032210012210100 |
5 | 102143304433143 |
6 | 3023305125040 |
7 | 324463554132 |
oct | 61644064420 |
9 | 18230342656 |
10 | 6686796048 |
11 | 2921581929 |
12 | 1367489780 |
13 | 82746416a |
14 | 47610b052 |
15 | 29209cd83 |
hex | 18e906910 |
6686796048 has 80 divisors (see below), whose sum is σ = 18333755136. Its totient is φ = 2092840960.
The previous prime is 6686796043. The next prime is 6686796059. The reversal of 6686796048 is 8406976866.
It is a junction number, because it is equal to n+sod(n) for n = 6686795982 and 6686796000.
It is not an unprimeable number, because it can be changed into a prime (6686796041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 342190 + ... + 361202.
Almost surely, 26686796048 is an apocalyptic number.
6686796048 is a gapful number since it is divisible by the number (68) 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 6686796048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9166877568).
6686796048 is an abundant number, since it is smaller than the sum of its proper divisors (11646959088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6686796048 is a wasteful number, since it uses less digits than its factorization.
6686796048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19472 (or 19466 counting only the distinct ones).
The product of its (nonzero) digits is 20901888, while the sum is 60.
The square root of 6686796048 is about 81772.8319675918. The cubic root of 6686796048 is about 1883.9644017597.
The spelling of 6686796048 in words is "six billion, six hundred eighty-six million, seven hundred ninety-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •