Base | Representation |
---|---|
bin | 1100101010111010… |
… | …11100100100110000 |
3 | 122120002002101022220 |
4 | 12111131130210300 |
5 | 102412414213241 |
6 | 3043001001040 |
7 | 330400140210 |
oct | 62535344460 |
9 | 18502071286 |
10 | 6802491696 |
11 | 2980913770 |
12 | 139a183180 |
13 | 845411b20 |
14 | 487626240 |
15 | 29c303166 |
hex | 19575c930 |
6802491696 has 320 divisors, whose sum is σ = 24361107456. Its totient is φ = 1578009600.
The previous prime is 6802491629. The next prime is 6802491697. The reversal of 6802491696 is 6961942086.
It is a super-3 number, since 3×68024916963 (a number of 30 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (6802491697) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1487205 + ... + 1491771.
Almost surely, 26802491696 is an apocalyptic number.
6802491696 is a gapful number since it is divisible by the number (66) 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 6802491696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12180553728).
6802491696 is an abundant number, since it is smaller than the sum of its proper divisors (17558615760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6802491696 is a wasteful number, since it uses less digits than its factorization.
6802491696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4640 (or 4634 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 51.
The square root of 6802491696 is about 82477.2192547736. The cubic root of 6802491696 is about 1894.7678485134.
The spelling of 6802491696 in words is "six billion, eight hundred two million, four hundred ninety-one thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •