Base | Representation |
---|---|
bin | 1011010010111101… |
… | …11010000000000000 |
3 | 120122122202111122122 |
4 | 11221132322000000 |
5 | 44410024124424 |
6 | 2441443023412 |
7 | 303200621441 |
oct | 55136720000 |
9 | 16578674578 |
10 | 6064676864 |
11 | 2632396544 |
12 | 121306ab68 |
13 | 7585c26bc |
14 | 4176472c8 |
15 | 25766145e |
hex | 1697ba000 |
6064676864 has 56 divisors (see below), whose sum is σ = 12300618528. Its totient is φ = 2989342720.
The previous prime is 6064676801. The next prime is 6064676867. The reversal of 6064676864 is 4686764606.
It is not an unprimeable number, because it can be changed into a prime (6064676867) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 576419 + ... + 586845.
Almost surely, 26064676864 is an apocalyptic number.
6064676864 is a gapful number since it is divisible by the number (64) 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 6064676864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6150309264).
6064676864 is an abundant number, since it is smaller than the sum of its proper divisors (6235941664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6064676864 is an equidigital number, since it uses as much as digits as its factorization.
6064676864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10524 (or 10500 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 53.
The square root of 6064676864 is about 77876.0352354946. The cubic root of 6064676864 is about 1823.6264752731.
The spelling of 6064676864 in words is "six billion, sixty-four million, six hundred seventy-six thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •