Base | Representation |
---|---|
bin | 1100001110100000… |
… | …1110000000000000 |
3 | 22110201211222002120 |
4 | 3003220032000000 |
5 | 23210204201344 |
6 | 1301402444240 |
7 | 144222251214 |
oct | 30350160000 |
9 | 8421758076 |
10 | 3282100224 |
11 | 1434729527 |
12 | 777203680 |
13 | 403c85b50 |
14 | 231c7a944 |
15 | 143219219 |
hex | c3a0e000 |
3282100224 has 112 divisors (see below), whose sum is σ = 9425860752. Its totient is φ = 1009778688.
The previous prime is 3282100187. The next prime is 3282100273. The reversal of 3282100224 is 4220012823.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 3282100194 and 3282100203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 314352 + ... + 324624.
It is an arithmetic number, because the mean of its divisors is an integer number (84159471).
Almost surely, 23282100224 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 3282100224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4712930376).
3282100224 is an abundant number, since it is smaller than the sum of its proper divisors (6143760528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3282100224 is a wasteful number, since it uses less digits than its factorization.
3282100224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10315 (or 10291 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 3282100224 is about 57289.6170697623. The cubic root of 3282100224 is about 1486.1088241569.
The spelling of 3282100224 in words is "three billion, two hundred eighty-two million, one hundred thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •