Base | Representation |
---|---|
bin | 1100101001110… |
… | …0010101011100 |
3 | 10200212012012000 |
4 | 3022130111130 |
5 | 102041203043 |
6 | 5133242300 |
7 | 1213036356 |
oct | 312342534 |
9 | 120765160 |
10 | 53069148 |
11 | 27a57700 |
12 | 15933390 |
13 | acc1382 |
14 | 70960d6 |
15 | 49d42d3 |
hex | 329c55c |
53069148 has 144 divisors (see below), whose sum is σ = 157301760. Its totient is φ = 15444000.
The previous prime is 53069141. The next prime is 53069153. The reversal of 53069148 is 84196035.
53069148 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 (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53069141) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 405043 + ... + 405173.
Almost surely, 253069148 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 53069148, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78650880).
53069148 is an abundant number, since it is smaller than the sum of its proper divisors (104232612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53069148 is a wasteful number, since it uses less digits than its factorization.
53069148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197 (or 178 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 53069148 is about 7284.8574454137. The cubic root of 53069148 is about 375.7918626989.
The spelling of 53069148 in words is "fifty-three million, sixty-nine thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •