Base | Representation |
---|---|
bin | 1100011100010101… |
… | …01010101111101000 |
3 | 122020112211200120020 |
4 | 12032022222233220 |
5 | 102140103102423 |
6 | 3022510200440 |
7 | 324353104155 |
oct | 61612525750 |
9 | 18215750506 |
10 | 6680128488 |
11 | 2918838450 |
12 | 13651b3120 |
13 | 825c6b367 |
14 | 47529322c |
15 | 2916d24e3 |
hex | 18e2aabe8 |
6680128488 has 64 divisors (see below), whose sum is σ = 18406422720. Its totient is φ = 2003404800.
The previous prime is 6680128451. The next prime is 6680128489. The reversal of 6680128488 is 8848210866.
It is a super-2 number, since 2×66801284882 = 89248233232378332288, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6680128488.
It is not an unprimeable number, because it can be changed into a prime (6680128489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104823 + ... + 156038.
It is an arithmetic number, because the mean of its divisors is an integer number (287600355).
Almost surely, 26680128488 is an apocalyptic number.
It is an amenable number.
6680128488 is an abundant number, since it is smaller than the sum of its proper divisors (11726294232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6680128488 is a wasteful number, since it uses less digits than its factorization.
6680128488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260978 (or 260974 counting only the distinct ones).
The product of its (nonzero) digits is 1179648, while the sum is 51.
The square root of 6680128488 is about 81732.0530024788. The cubic root of 6680128488 is about 1883.3380119305.
The spelling of 6680128488 in words is "six billion, six hundred eighty million, one hundred twenty-eight thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •