Base | Representation |
---|---|
bin | 11010001010000001100000 |
3 | 110220100202120 |
4 | 122022001200 |
5 | 3223404200 |
6 | 402544240 |
7 | 112165446 |
oct | 32120140 |
9 | 13810676 |
10 | 6856800 |
11 | 3963685 |
12 | 2368080 |
13 | 1560ca2 |
14 | ca6b96 |
15 | 9069a0 |
hex | 68a060 |
6856800 has 72 divisors (see below), whose sum is σ = 22326696. Its totient is φ = 1827840.
The previous prime is 6856781. The next prime is 6856819. The reversal of 6856800 is 86586.
It is an interprime number because it is at equal distance from previous prime (6856781) and next prime (6856819).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 972 + ... + 3828.
It is an arithmetic number, because the mean of its divisors is an integer number (310093).
Almost surely, 26856800 is an apocalyptic number.
6856800 is a gapful number since it is divisible by the number (60) 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 6856800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11163348).
6856800 is an abundant number, since it is smaller than the sum of its proper divisors (15469896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6856800 is a wasteful number, since it uses less digits than its factorization.
6856800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2880 (or 2867 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 6856800 is about 2618.5492166465. The cubic root of 6856800 is about 189.9796838850.
The spelling of 6856800 in words is "six million, eight hundred fifty-six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •