Base | Representation |
---|---|
bin | 1100101110111… |
… | …0011100111100 |
3 | 10201111021120111 |
4 | 3023232130330 |
5 | 102132434000 |
6 | 5144355404 |
7 | 1215640111 |
oct | 313563474 |
9 | 121437514 |
10 | 53405500 |
11 | 28167385 |
12 | 15a75b64 |
13 | b0ab4b5 |
14 | 7142908 |
15 | 4a4dcba |
hex | 32ee73c |
53405500 has 96 divisors (see below), whose sum is σ = 126741888. Its totient is φ = 19584000.
The previous prime is 53405497. The next prime is 53405507. The reversal of 53405500 is 550435.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53405507) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 518449 + ... + 518551.
It is an arithmetic number, because the mean of its divisors is an integer number (1320228).
Almost surely, 253405500 is an apocalyptic number.
53405500 is a gapful number since it is divisible by the number (50) 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 53405500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63370944).
53405500 is an abundant number, since it is smaller than the sum of its proper divisors (73336388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53405500 is a wasteful number, since it uses less digits than its factorization.
53405500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200 (or 188 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 22.
The square root of 53405500 is about 7307.9066770177. The cubic root of 53405500 is about 376.5841136163.
Adding to 53405500 its reverse (550435), we get a palindrome (53955935).
The spelling of 53405500 in words is "fifty-three million, four hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •