Base | Representation |
---|---|
bin | 1100001000110… |
… | …1101110010011 |
3 | 10112210121100002 |
4 | 3002031232103 |
5 | 101013142042 |
6 | 5015120215 |
7 | 1155513626 |
oct | 302155623 |
9 | 115717302 |
10 | 50912147 |
11 | 26814060 |
12 | 1507306b |
13 | a717640 |
14 | 6a93dbd |
15 | 470a132 |
hex | 308db93 |
50912147 has 16 divisors (see below), whose sum is σ = 60023040. Its totient is φ = 42573600.
The previous prime is 50912143. The next prime is 50912149. The reversal of 50912147 is 74121905.
50912147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 50912147 - 22 = 50912143 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50912143) 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 15 ways as a sum of consecutive naturals, for example, 62372 + ... + 63182.
It is an arithmetic number, because the mean of its divisors is an integer number (3751440).
Almost surely, 250912147 is an apocalyptic number.
50912147 is a deficient number, since it is larger than the sum of its proper divisors (9110893).
50912147 is a wasteful number, since it uses less digits than its factorization.
50912147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1274.
The product of its (nonzero) digits is 2520, while the sum is 29.
The square root of 50912147 is about 7135.2748370333. The cubic root of 50912147 is about 370.6299155325.
The spelling of 50912147 in words is "fifty million, nine hundred twelve thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •