Base | Representation |
---|---|
bin | 1100101011001001… |
… | …10000111100100000 |
3 | 122120012200211221112 |
4 | 12111210300330200 |
5 | 102413412111034 |
6 | 3043110042452 |
7 | 330422350310 |
oct | 62544607440 |
9 | 18505624845 |
10 | 6804410144 |
11 | 2981a04064 |
12 | 139a949428 |
13 | 8459340bc |
14 | 4879a5440 |
15 | 29c5817ce |
hex | 195930f20 |
6804410144 has 96 divisors (see below), whose sum is σ = 15503394816. Its totient is φ = 2879585280.
The previous prime is 6804410117. The next prime is 6804410153. The reversal of 6804410144 is 4410144086.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 6804410144.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6716582 + ... + 6717594.
It is an arithmetic number, because the mean of its divisors is an integer number (161493696).
Almost surely, 26804410144 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 6804410144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7751697408).
6804410144 is an abundant number, since it is smaller than the sum of its proper divisors (8698984672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6804410144 is a wasteful number, since it uses less digits than its factorization.
6804410144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1378 (or 1370 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 32.
The square root of 6804410144 is about 82488.8486039174. The cubic root of 6804410144 is about 1894.9459534436.
The spelling of 6804410144 in words is "six billion, eight hundred four million, four hundred ten thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •