Base | Representation |
---|---|
bin | 1100101100100… |
… | …1000101100100 |
3 | 10201012111122001 |
4 | 3023021011210 |
5 | 102113034302 |
6 | 5141215044 |
7 | 1214431651 |
oct | 313110544 |
9 | 121174561 |
10 | 53252452 |
11 | 280723a0 |
12 | 15a01484 |
13 | b056936 |
14 | 7102c28 |
15 | 4a1d787 |
hex | 32c9164 |
53252452 has 48 divisors (see below), whose sum is σ = 107339904. Its totient is φ = 22880000.
The previous prime is 53252443. The next prime is 53252453. The reversal of 53252452 is 25425235.
53252452 = 2592 + 2602 + ... + 5612.
It is a self number, because there is not a number n which added to its sum of digits gives 53252452.
It is not an unprimeable number, because it can be changed into a prime (53252453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101952 + ... + 102472.
It is an arithmetic number, because the mean of its divisors is an integer number (2236248).
Almost surely, 253252452 is an apocalyptic number.
It is an amenable number.
53252452 is an abundant number, since it is smaller than the sum of its proper divisors (54087452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53252452 is a wasteful number, since it uses less digits than its factorization.
53252452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660 (or 658 counting only the distinct ones).
The product of its digits is 12000, while the sum is 28.
The square root of 53252452 is about 7297.4277660008. The cubic root of 53252452 is about 376.2240346610.
Adding to 53252452 its reverse (25425235), we get a palindrome (78677687).
It can be divided in two parts, 5325 and 2452, that added together give a palindrome (7777).
The spelling of 53252452 in words is "fifty-three million, two hundred fifty-two thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •