Base | Representation |
---|---|
bin | 1100101100100… |
… | …1001101000000 |
3 | 10201012112021200 |
4 | 3023021031000 |
5 | 102113043203 |
6 | 5141221200 |
7 | 1214433231 |
oct | 313111500 |
9 | 121175250 |
10 | 53252928 |
11 | 28072793 |
12 | 15a01800 |
13 | b056c11 |
14 | 7103088 |
15 | 4a1d9a3 |
hex | 32c9340 |
53252928 has 84 divisors (see below), whose sum is σ = 155326080. Its totient is φ = 17438976.
The previous prime is 53252923. The next prime is 53252951. The reversal of 53252928 is 82925235.
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 = 53252892 and 53252901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53252921) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33201 + ... + 34767.
It is an arithmetic number, because the mean of its divisors is an integer number (1849120).
Almost surely, 253252928 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 53252928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77663040).
53252928 is an abundant number, since it is smaller than the sum of its proper divisors (102073152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53252928 is a wasteful number, since it uses less digits than its factorization.
53252928 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1644 (or 1631 counting only the distinct ones).
The product of its digits is 43200, while the sum is 36.
The square root of 53252928 is about 7297.4603801597. The cubic root of 53252928 is about 376.2251556242.
The spelling of 53252928 in words is "fifty-three million, two hundred fifty-two thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •