Base | Representation |
---|---|
bin | 1100101011110000… |
… | …10011000100010000 |
3 | 122120120022222221112 |
4 | 12111320103010100 |
5 | 102421214440030 |
6 | 3043411512452 |
7 | 330514025003 |
oct | 62570230420 |
9 | 18516288845 |
10 | 6809530640 |
11 | 2984891180 |
12 | 13a05b8728 |
13 | 846a07993 |
14 | 48853953a |
15 | 29cc43a95 |
hex | 195e13110 |
6809530640 has 80 divisors (see below), whose sum is σ = 17344247040. Its totient is φ = 2465756160.
The previous prime is 6809530639. The next prime is 6809530681. The reversal of 6809530640 is 460359086.
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 194132 + ... + 226508.
It is an arithmetic number, because the mean of its divisors is an integer number (216803088).
Almost surely, 26809530640 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 6809530640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8672123520).
6809530640 is an abundant number, since it is smaller than the sum of its proper divisors (10534716400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6809530640 is a wasteful number, since it uses less digits than its factorization.
6809530640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32640 (or 32634 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 41.
The square root of 6809530640 is about 82519.8802713625. The cubic root of 6809530640 is about 1895.4211663349.
The spelling of 6809530640 in words is "six billion, eight hundred nine million, five hundred thirty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •