Base | Representation |
---|---|
bin | 1100000101110010… |
… | …01110011000100000 |
3 | 121202100222021222000 |
4 | 12002321032120200 |
5 | 101243144201441 |
6 | 2552032444000 |
7 | 316565434122 |
oct | 60271163040 |
9 | 17670867860 |
10 | 6491006496 |
11 | 2831005287 |
12 | 13119a9600 |
13 | 7c5a22460 |
14 | 458103212 |
15 | 27ecc62b6 |
hex | 182e4e620 |
6491006496 has 192 divisors, whose sum is σ = 20940796800. Its totient is φ = 1943129088.
The previous prime is 6491006443. The next prime is 6491006507. The reversal of 6491006496 is 6946001946.
It is a super-2 number, since 2×64910064962 = 84266330662228396032, which contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 407775 + ... + 423393.
It is an arithmetic number, because the mean of its divisors is an integer number (109066650).
Almost surely, 26491006496 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 6491006496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10470398400).
6491006496 is an abundant number, since it is smaller than the sum of its proper divisors (14449790304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6491006496 is a wasteful number, since it uses less digits than its factorization.
6491006496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15688 (or 15674 counting only the distinct ones).
The product of its (nonzero) digits is 279936, while the sum is 45.
The square root of 6491006496 is about 80566.7828326290. The cubic root of 6491006496 is about 1865.3944541052.
The spelling of 6491006496 in words is "six billion, four hundred ninety-one million, six thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •