Base | Representation |
---|---|
bin | 1100000100110… |
… | …1000001110000 |
3 | 10112022010211110 |
4 | 3001031001300 |
5 | 100431202102 |
6 | 5005313320 |
7 | 1153331223 |
oct | 301150160 |
9 | 115263743 |
10 | 50647152 |
11 | 26652a56 |
12 | 14b65840 |
13 | a653b3a |
14 | 6a255ba |
15 | 46a686c |
hex | 304d070 |
50647152 has 40 divisors (see below), whose sum is σ = 131797120. Its totient is φ = 16758720.
The previous prime is 50647151. The next prime is 50647169. The reversal of 50647152 is 25174605.
It is a super-2 number, since 2×506471522 = 5130268011422208, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50647151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2877 + ... + 10467.
It is an arithmetic number, because the mean of its divisors is an integer number (3294928).
Almost surely, 250647152 is an apocalyptic number.
It is an amenable number.
50647152 is an abundant number, since it is smaller than the sum of its proper divisors (81149968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50647152 is a wasteful number, since it uses less digits than its factorization.
50647152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7741 (or 7735 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 30.
The square root of 50647152 is about 7116.6812490093. The cubic root of 50647152 is about 369.9857603480.
The spelling of 50647152 in words is "fifty million, six hundred forty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •