Base | Representation |
---|---|
bin | 1100000011100… |
… | …1011111110000 |
3 | 10112011002002111 |
4 | 3000321133300 |
5 | 100421122102 |
6 | 5003455104 |
7 | 1152546046 |
oct | 300713760 |
9 | 115132074 |
10 | 50567152 |
11 | 265a8939 |
12 | 14b27494 |
13 | a6265bc |
14 | 6a04396 |
15 | 468ccd7 |
hex | 30397f0 |
50567152 has 20 divisors (see below), whose sum is σ = 98219656. Its totient is φ = 25220160.
The previous prime is 50567149. The next prime is 50567177. The reversal of 50567152 is 25176505.
50567152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×505671522 = 5114073722782208, which contains 22 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 2983 + ... + 10489.
Almost surely, 250567152 is an apocalyptic number.
It is an amenable number.
50567152 is a deficient number, since it is larger than the sum of its proper divisors (47652504).
50567152 is a wasteful number, since it uses less digits than its factorization.
50567152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7936 (or 7930 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 31.
The square root of 50567152 is about 7111.0584303604. The cubic root of 50567152 is about 369.7908533118.
The spelling of 50567152 in words is "fifty million, five hundred sixty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •