Base | Representation |
---|---|
bin | 1100000000110011… |
… | …0011111101101000 |
3 | 22022201121211201112 |
4 | 3000030303331220 |
5 | 23100443142130 |
6 | 1251550005452 |
7 | 142623340436 |
oct | 30014637550 |
9 | 8281554645 |
10 | 3224584040 |
11 | 1405214797 |
12 | 75baa6888 |
13 | 3c50985c2 |
14 | 228387d56 |
15 | 13d157495 |
hex | c0333f68 |
3224584040 has 128 divisors (see below), whose sum is σ = 7814016000. Its totient is φ = 1195223040.
The previous prime is 3224584039. The next prime is 3224584043. The reversal of 3224584040 is 404854223.
It is a junction number, because it is equal to n+sod(n) for n = 3224583988 and 3224584006.
It is not an unprimeable number, because it can be changed into a prime (3224584043) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3073436 + ... + 3074484.
It is an arithmetic number, because the mean of its divisors is an integer number (61047000).
Almost surely, 23224584040 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 3224584040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3907008000).
3224584040 is an abundant number, since it is smaller than the sum of its proper divisors (4589431960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3224584040 is a wasteful number, since it uses less digits than its factorization.
3224584040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1195 (or 1191 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 32.
The square root of 3224584040 is about 56785.4210163137. The cubic root of 3224584040 is about 1477.3766591095.
The spelling of 3224584040 in words is "three billion, two hundred twenty-four million, five hundred eighty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •