Base | Representation |
---|---|
bin | 1000001101110001… |
… | …0111100101011000 |
3 | 12200200120101221100 |
4 | 2003130113211120 |
5 | 14004021030203 |
6 | 1002454111400 |
7 | 105435221625 |
oct | 20334274530 |
9 | 5620511840 |
10 | 2205251928 |
11 | a31897460 |
12 | 51664b560 |
13 | 291b4ccc9 |
14 | 16cc4734c |
15 | cd907ea3 |
hex | 83717958 |
2205251928 has 96 divisors (see below), whose sum is σ = 6523545600. Its totient is φ = 667435200.
The previous prime is 2205251903. The next prime is 2205251969. The reversal of 2205251928 is 8291525022.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 2205251892 and 2205251901.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1043593 + ... + 1045703.
It is an arithmetic number, because the mean of its divisors is an integer number (67953600).
Almost surely, 22205251928 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 2205251928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3261772800).
2205251928 is an abundant number, since it is smaller than the sum of its proper divisors (4318293672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2205251928 is a wasteful number, since it uses less digits than its factorization.
2205251928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3453 (or 3446 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The square root of 2205251928 is about 46960.1099657997. The cubic root of 2205251928 is about 1301.6255656993.
The spelling of 2205251928 in words is "two billion, two hundred five million, two hundred fifty-one thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •