Base | Representation |
---|---|
bin | 1100101011011100… |
… | …00100010000000000 |
3 | 122120101021201202110 |
4 | 12111232010100000 |
5 | 102420023123022 |
6 | 3043234215320 |
7 | 330452154252 |
oct | 62556042000 |
9 | 18511251673 |
10 | 6806848512 |
11 | 298331a042 |
12 | 139b724540 |
13 | 8462a8c19 |
14 | 48803bcd2 |
15 | 29c8b400c |
hex | 195b84400 |
6806848512 has 176 divisors, whose sum is σ = 18718947072. Its totient is φ = 2198077440.
The previous prime is 6806848417. The next prime is 6806848537. The reversal of 6806848512 is 2158486086.
It is a happy number.
It is a super-2 number, since 2×68068485122 = 92666373330633228288, which contains 22 as substring.
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 (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15792937 + ... + 15793367.
Almost surely, 26806848512 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 6806848512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9359473536).
6806848512 is an abundant number, since it is smaller than the sum of its proper divisors (11912098560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6806848512 is a wasteful number, since it uses less digits than its factorization.
6806848512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604 (or 586 counting only the distinct ones).
The product of its (nonzero) digits is 737280, while the sum is 48.
The square root of 6806848512 is about 82503.6272657148. The cubic root of 6806848512 is about 1895.1722784131.
The spelling of 6806848512 in words is "six billion, eight hundred six million, eight hundred forty-eight thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •