Base | Representation |
---|---|
bin | 1101010110101… |
… | …1100100110000 |
3 | 10220101212100021 |
4 | 3111223210300 |
5 | 103314441102 |
6 | 5320333224 |
7 | 1250056324 |
oct | 325534460 |
9 | 126355307 |
10 | 56015152 |
11 | 2968a016 |
12 | 16914214 |
13 | b7b327b |
14 | 7621984 |
15 | 4db7137 |
hex | 356b930 |
56015152 has 20 divisors (see below), whose sum is σ = 108655000. Its totient is φ = 27975168.
The previous prime is 56015137. The next prime is 56015159. The reversal of 56015152 is 25151065.
56015152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (56015159) 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 3 ways as a sum of consecutive naturals, for example, 18583 + ... + 21385.
It is an arithmetic number, because the mean of its divisors is an integer number (5432750).
Almost surely, 256015152 is an apocalyptic number.
It is an amenable number.
56015152 is a deficient number, since it is larger than the sum of its proper divisors (52639848).
56015152 is a wasteful number, since it uses less digits than its factorization.
56015152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4060 (or 4054 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The square root of 56015152 is about 7484.3270906609. The cubic root of 56015152 is about 382.6207390777.
The spelling of 56015152 in words is "fifty-six million, fifteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •