Base | Representation |
---|---|
bin | 1100110010111… |
… | …0111011000000 |
3 | 10201222200210210 |
4 | 3030232323000 |
5 | 102214411233 |
6 | 5154154120 |
7 | 1221120021 |
oct | 314567300 |
9 | 121880723 |
10 | 53669568 |
11 | 28327817 |
12 | 15b82940 |
13 | b171754 |
14 | 71b0c48 |
15 | 4aa2163 |
hex | 332eec0 |
53669568 has 56 divisors (see below), whose sum is σ = 143093440. Its totient is φ = 17752320.
The previous prime is 53669537. The next prime is 53669593. The reversal of 53669568 is 86596635.
53669568 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25683 + ... + 27693.
It is an arithmetic number, because the mean of its divisors is an integer number (2555240).
Almost surely, 253669568 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 53669568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71546720).
53669568 is an abundant number, since it is smaller than the sum of its proper divisors (89423872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53669568 is a wasteful number, since it uses less digits than its factorization.
53669568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2165 (or 2155 counting only the distinct ones).
The product of its digits is 1166400, while the sum is 48.
The square root of 53669568 is about 7325.9516787923. The cubic root of 53669568 is about 377.2037773818.
The spelling of 53669568 in words is "fifty-three million, six hundred sixty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •