Base | Representation |
---|---|
bin | 1100011011110… |
… | …0101110111000 |
3 | 10122010122211200 |
4 | 3012330232320 |
5 | 101322401042 |
6 | 5101454200 |
7 | 1202203233 |
oct | 306745670 |
9 | 118118750 |
10 | 52153272 |
11 | 27491586 |
12 | 15571360 |
13 | aa60532 |
14 | 6cd841a |
15 | 48a2c4c |
hex | 31bcbb8 |
52153272 has 96 divisors (see below), whose sum is σ = 146577600. Its totient is φ = 16743168.
The previous prime is 52153249. The next prime is 52153301. The reversal of 52153272 is 27235125.
It is a super-3 number, since 3×521532723 (a number of 24 digits) contains 333 as substring.
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, 301378 + ... + 301550.
It is an arithmetic number, because the mean of its divisors is an integer number (1526850).
Almost surely, 252153272 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 52153272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73288800).
52153272 is an abundant number, since it is smaller than the sum of its proper divisors (94424328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52153272 is a wasteful number, since it uses less digits than its factorization.
52153272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317 (or 310 counting only the distinct ones).
The product of its digits is 4200, while the sum is 27.
The square root of 52153272 is about 7221.7222322657. The cubic root of 52153272 is about 373.6174799660.
Adding to 52153272 its reverse (27235125), we get a palindrome (79388397).
It can be divided in two parts, 52153 and 272, that added together give a palindrome (52425).
The spelling of 52153272 in words is "fifty-two million, one hundred fifty-three thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •