Base | Representation |
---|---|
bin | 1100011100000101000000 |
3 | 20010122220000 |
4 | 30130011000 |
5 | 1313320421 |
6 | 153520000 |
7 | 36500343 |
oct | 14340500 |
9 | 6118800 |
10 | 3260736 |
11 | 1927926 |
12 | 1113000 |
13 | 8a223b |
14 | 60c45a |
15 | 446226 |
hex | 31c140 |
3260736 has 140 divisors (see below), whose sum is σ = 10511028. Its totient is φ = 995328.
The previous prime is 3260729. The next prime is 3260749. The reversal of 3260736 is 6370623.
It can be written as a sum of positive squares in 2 ways, for example, as 2742336 + 518400 = 1656^2 + 720^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 88110 + ... + 88146.
Almost surely, 23260736 is an apocalyptic number.
3260736 is a gapful number since it is divisible by the number (36) 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 3260736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5255514).
3260736 is an abundant number, since it is smaller than the sum of its proper divisors (7250292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3260736 is a wasteful number, since it uses less digits than its factorization.
3260736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 27.
The square root of 3260736 is about 1805.7508133738. The cubic root of 3260736 is about 148.2877285493.
The spelling of 3260736 in words is "three million, two hundred sixty thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •