Base | Representation |
---|---|
bin | 1100110101100000… |
… | …10111001100100000 |
3 | 122210021021011110110 |
4 | 12122300113030200 |
5 | 103103140231410 |
6 | 3055453131320 |
7 | 332526252000 |
oct | 63260271440 |
9 | 18707234413 |
10 | 6891336480 |
11 | 2a16a86106 |
12 | 1403a89b40 |
13 | 85a94acc2 |
14 | 495352000 |
15 | 2a5002720 |
hex | 19ac17320 |
6891336480 has 384 divisors, whose sum is σ = 26659584000. Its totient is φ = 1491581952.
The previous prime is 6891336479. The next prime is 6891336493. The reversal of 6891336480 is 846331986.
It is a Harshad number since it is a multiple of its sum of digits (48).
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, 3127059 + ... + 3129261.
It is an arithmetic number, because the mean of its divisors is an integer number (69426000).
Almost surely, 26891336480 is an apocalyptic number.
6891336480 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 6891336480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13329792000).
6891336480 is an abundant number, since it is smaller than the sum of its proper divisors (19768247520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6891336480 is a wasteful number, since it uses less digits than its factorization.
6891336480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2261 (or 2239 counting only the distinct ones).
The product of its (nonzero) digits is 746496, while the sum is 48.
The square root of 6891336480 is about 83014.0739874872. The cubic root of 6891336480 is about 1902.9811446291.
The spelling of 6891336480 in words is "six billion, eight hundred ninety-one million, three hundred thirty-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •