Base | Representation |
---|---|
bin | 1011100010010101111100 |
3 | 12200122111100 |
4 | 23202111330 |
5 | 1233234002 |
6 | 144453100 |
7 | 34464030 |
oct | 13422574 |
9 | 5618440 |
10 | 3024252 |
11 | 1786190 |
12 | 101a190 |
13 | 81b6ca |
14 | 58a1c0 |
15 | 3eb11c |
hex | 2e257c |
3024252 has 72 divisors (see below), whose sum is σ = 9539712. Its totient is φ = 784800.
The previous prime is 3024227. The next prime is 3024311. The reversal of 3024252 is 2524203.
It is a super-2 number, since 2×30242522 = 18292200319008, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 2227 + ... + 3317.
It is an arithmetic number, because the mean of its divisors is an integer number (132496).
Almost surely, 23024252 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 3024252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4769856).
3024252 is an abundant number, since it is smaller than the sum of its proper divisors (6515460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3024252 is a wasteful number, since it uses less digits than its factorization.
3024252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1119 (or 1114 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 18.
The square root of 3024252 is about 1739.0376649170. The cubic root of 3024252 is about 144.6125526427.
Adding to 3024252 its reverse (2524203), we get a palindrome (5548455).
It can be divided in two parts, 302 and 4252, that added together give a palindrome (4554).
The spelling of 3024252 in words is "three million, twenty-four thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •