Base | Representation |
---|---|
bin | 1100101111110… |
… | …1000001000000 |
3 | 10201121022101211 |
4 | 3023331001000 |
5 | 102141341102 |
6 | 5145535504 |
7 | 1216306036 |
oct | 313750100 |
9 | 121538354 |
10 | 53465152 |
11 | 281a8184 |
12 | 15aa4594 |
13 | b0cc6b0 |
14 | 715a556 |
15 | 4a617d7 |
hex | 32fd040 |
53465152 has 56 divisors (see below), whose sum is σ = 115214400. Its totient is φ = 24470016.
The previous prime is 53465143. The next prime is 53465171. The reversal of 53465152 is 25156435.
It is an unprimeable number.
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, 148749 + ... + 149107.
It is an arithmetic number, because the mean of its divisors is an integer number (2057400).
Almost surely, 253465152 is an apocalyptic number.
53465152 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53465152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57607200).
53465152 is an abundant number, since it is smaller than the sum of its proper divisors (61749248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53465152 is a wasteful number, since it uses less digits than its factorization.
53465152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563 (or 553 counting only the distinct ones).
The product of its digits is 18000, while the sum is 31.
The square root of 53465152 is about 7311.9868708854. The cubic root of 53465152 is about 376.7242716955.
The spelling of 53465152 in words is "fifty-three million, four hundred sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •