Base | Representation |
---|---|
bin | 1100000100101011… |
… | …0001100001010000 |
3 | 22100212012001211011 |
4 | 3001022301201100 |
5 | 23114122430320 |
6 | 1253330100304 |
7 | 143211401050 |
oct | 30112614120 |
9 | 8325161734 |
10 | 3240826960 |
11 | 14133a9298 |
12 | 76541a694 |
13 | 3c85648b7 |
14 | 22a5b5560 |
15 | 13e7b505a |
hex | c12b1850 |
3240826960 has 480 divisors, whose sum is σ = 10286341632. Its totient is φ = 924549120.
The previous prime is 3240826957. The next prime is 3240826969. The reversal of 3240826960 is 696280423.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3240826969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 79044540 + ... + 79044580.
Almost surely, 23240826960 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 3240826960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5143170816).
3240826960 is an abundant number, since it is smaller than the sum of its proper divisors (7045514672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3240826960 is a wasteful number, since it uses less digits than its factorization.
3240826960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139 (or 114 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 40.
The square root of 3240826960 is about 56928.2615227270. The cubic root of 3240826960 is about 1479.8531264037.
The spelling of 3240826960 in words is "three billion, two hundred forty million, eight hundred twenty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •