Base | Representation |
---|---|
bin | 1100101100000… |
… | …0101111100000 |
3 | 10201010202202010 |
4 | 3023000233200 |
5 | 102110441042 |
6 | 5140352520 |
7 | 1214230212 |
oct | 313005740 |
9 | 121122663 |
10 | 53218272 |
11 | 28049748 |
12 | 159a5740 |
13 | b044203 |
14 | 70d45b2 |
15 | 4a1359c |
hex | 32c0be0 |
53218272 has 48 divisors (see below), whose sum is σ = 141402240. Its totient is φ = 17523072.
The previous prime is 53218267. The next prime is 53218273. The reversal of 53218272 is 27281235.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53218273) 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 7 ways as a sum of consecutive naturals, for example, 4629 + ... + 11307.
It is an arithmetic number, because the mean of its divisors is an integer number (2945880).
Almost surely, 253218272 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 53218272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70701120).
53218272 is an abundant number, since it is smaller than the sum of its proper divisors (88183968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53218272 is a wasteful number, since it uses less digits than its factorization.
53218272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6775 (or 6767 counting only the distinct ones).
The product of its digits is 6720, while the sum is 30.
The square root of 53218272 is about 7295.0854689990. The cubic root of 53218272 is about 376.1435245045.
The spelling of 53218272 in words is "fifty-three million, two hundred eighteen thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •