Base | Representation |
---|---|
bin | 1100001001010111… |
… | …0101101001011000 |
3 | 22102020012210120000 |
4 | 3002111311221120 |
5 | 23134142122124 |
6 | 1255311533000 |
7 | 143540555334 |
oct | 30225655130 |
9 | 8366183500 |
10 | 3260504664 |
11 | 142351945a |
12 | 76bb2a160 |
13 | 3cc664401 |
14 | 22d0587c4 |
15 | 1413a06c9 |
hex | c2575a58 |
3260504664 has 160 divisors (see below), whose sum is σ = 9906850800. Its totient is φ = 997816320.
The previous prime is 3260504659. The next prime is 3260504699. The reversal of 3260504664 is 4664050623.
3260504664 is a `hidden beast` number, since 3 + 2 + 605 + 0 + 46 + 6 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 448047 + ... + 455265.
Almost surely, 23260504664 is an apocalyptic number.
3260504664 is a gapful number since it is divisible by the number (34) 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 3260504664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4953425400).
3260504664 is an abundant number, since it is smaller than the sum of its proper divisors (6646346136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3260504664 is a wasteful number, since it uses less digits than its factorization.
3260504664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7295 (or 7282 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 36.
The square root of 3260504664 is about 57100.8289256820. The cubic root of 3260504664 is about 1482.8422166199.
The spelling of 3260504664 in words is "three billion, two hundred sixty million, five hundred four thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •