Base | Representation |
---|---|
bin | 1011010111110110… |
… | …0110101001110000 |
3 | 21212202102120220000 |
4 | 2311331212221300 |
5 | 22223010401300 |
6 | 1222532350000 |
7 | 135436405005 |
oct | 26575465160 |
9 | 7782376800 |
10 | 3052825200 |
11 | 1327270837 |
12 | 712475300 |
13 | 39861b859 |
14 | 20d6378ac |
15 | 12d02ac00 |
hex | b5f66a70 |
3052825200 has 300 divisors, whose sum is σ = 11149022280. Its totient is φ = 799787520.
The previous prime is 3052825189. The next prime is 3052825219. The reversal of 3052825200 is 25282503.
It is a tau number, because it is divible by the number of its divisors (300).
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 polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 1910802 + ... + 1912398.
Almost surely, 23052825200 is an apocalyptic number.
3052825200 is a gapful number since it is divisible by the number (30) 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 3052825200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5574511140).
3052825200 is an abundant number, since it is smaller than the sum of its proper divisors (8096197080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3052825200 is a wasteful number, since it uses less digits than its factorization.
3052825200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1686 (or 1666 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 3052825200 is about 55252.3773244193. The cubic root of 3052825200 is about 1450.6656000877.
The spelling of 3052825200 in words is "three billion, fifty-two million, eight hundred twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •