Base | Representation |
---|---|
bin | 1101000000100100… |
… | …11101001110000000 |
3 | 200000201221002120100 |
4 | 12200102131032000 |
5 | 103300421111003 |
6 | 3113010442400 |
7 | 335034244611 |
oct | 64022351600 |
9 | 20021832510 |
10 | 6984160128 |
11 | 2a64415970 |
12 | 142ab93400 |
13 | 873c4b23a |
14 | 4a37d5c08 |
15 | 2ad23aba3 |
hex | 1a049d380 |
6984160128 has 384 divisors, whose sum is σ = 23646504960. Its totient is φ = 1956556800.
The previous prime is 6984160123. The next prime is 6984160153. The reversal of 6984160128 is 8210614896.
It is a tau number, because it is divible by the number of its divisors (384).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6984160123) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9034750 + ... + 9035522.
It is an arithmetic number, because the mean of its divisors is an integer number (61579440).
Almost surely, 26984160128 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 6984160128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11823252480).
6984160128 is an abundant number, since it is smaller than the sum of its proper divisors (16662344832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6984160128 is a wasteful number, since it uses less digits than its factorization.
6984160128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 858 (or 843 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 45.
The square root of 6984160128 is about 83571.2877009802. The cubic root of 6984160128 is about 1911.4872080596.
The spelling of 6984160128 in words is "six billion, nine hundred eighty-four million, one hundred sixty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •