Base | Representation |
---|---|
bin | 1101010111100… |
… | …0110000011100 |
3 | 10220111121102010 |
4 | 3111320300130 |
5 | 103323203043 |
6 | 5321431220 |
7 | 1250402622 |
oct | 325706034 |
9 | 126447363 |
10 | 56069148 |
11 | 29716643 |
12 | 1693b510 |
13 | b801a15 |
14 | 7637512 |
15 | 4dc8133 |
hex | 3578c1c |
56069148 has 24 divisors (see below), whose sum is σ = 131028352. Its totient is φ = 18661104.
The previous prime is 56069129. The next prime is 56069149. The reversal of 56069148 is 84196065.
56069148 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56069149) 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 7 ways as a sum of consecutive naturals, for example, 5511 + ... + 11937.
Almost surely, 256069148 is an apocalyptic number.
It is an amenable number.
56069148 is an abundant number, since it is smaller than the sum of its proper divisors (74959204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56069148 is a wasteful number, since it uses less digits than its factorization.
56069148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7161 (or 7159 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The square root of 56069148 is about 7487.9334932944. The cubic root of 56069148 is about 382.7436424579.
The spelling of 56069148 in words is "fifty-six million, sixty-nine thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •