Base | Representation |
---|---|
bin | 1100110011010… |
… | …1001011100000 |
3 | 10202000222222010 |
4 | 3030311023200 |
5 | 102221221300 |
6 | 5154512520 |
7 | 1221254526 |
oct | 314651340 |
9 | 122028863 |
10 | 53695200 |
11 | 28344aa9 |
12 | 15b95740 |
13 | b180310 |
14 | 71ba316 |
15 | 4aa9a50 |
hex | 33352e0 |
53695200 has 144 divisors (see below), whose sum is σ = 188331696. Its totient is φ = 13209600.
The previous prime is 53695141. The next prime is 53695217. The reversal of 53695200 is 259635.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 30340 + ... + 32060.
It is an arithmetic number, because the mean of its divisors is an integer number (1307859).
Almost surely, 253695200 is an apocalyptic number.
53695200 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 53695200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94165848).
53695200 is an abundant number, since it is smaller than the sum of its proper divisors (134636496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53695200 is a wasteful number, since it uses less digits than its factorization.
53695200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1757 (or 1744 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 30.
The square root of 53695200 is about 7327.7008672571. The cubic root of 53695200 is about 377.2638172940.
The spelling of 53695200 in words is "fifty-three million, six hundred ninety-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •