Base | Representation |
---|---|
bin | 1100110001101001… |
… | …01001110010010000 |
3 | 122201000020120021000 |
4 | 12120310221302100 |
5 | 103021340004033 |
6 | 3052334102000 |
7 | 331653513510 |
oct | 63064516220 |
9 | 18630216230 |
10 | 6858906768 |
11 | 29aa74619a |
12 | 13b504a900 |
13 | 85400511c |
14 | 490d0d840 |
15 | 2a2248a13 |
hex | 198d29c90 |
6858906768 has 320 divisors, whose sum is σ = 24077744640. Its totient is φ = 1824768000.
The previous prime is 6858906757. The next prime is 6858906787. The reversal of 6858906768 is 8676098586.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5191548 + ... + 5192868.
It is an arithmetic number, because the mean of its divisors is an integer number (75242952).
Almost surely, 26858906768 is an apocalyptic number.
6858906768 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 6858906768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12038872320).
6858906768 is an abundant number, since it is smaller than the sum of its proper divisors (17218837872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6858906768 is a wasteful number, since it uses less digits than its factorization.
6858906768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1463 (or 1451 counting only the distinct ones).
The product of its (nonzero) digits is 34836480, while the sum is 63.
The square root of 6858906768 is about 82818.5170598943. The cubic root of 6858906768 is about 1899.9913912814.
The spelling of 6858906768 in words is "six billion, eight hundred fifty-eight million, nine hundred six thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •