Base | Representation |
---|---|
bin | 1100000010111… |
… | …0111101000011 |
3 | 10112001212212012 |
4 | 3000232331003 |
5 | 100413231341 |
6 | 5002523135 |
7 | 1152306131 |
oct | 300567503 |
9 | 115055765 |
10 | 50523971 |
11 | 26579453 |
12 | 14b064ab |
13 | a60ca54 |
14 | 69d2751 |
15 | 46800eb |
hex | 302ef43 |
50523971 has 2 divisors, whose sum is σ = 50523972. Its totient is φ = 50523970.
The previous prime is 50523961. The next prime is 50523989. The reversal of 50523971 is 17932505.
50523971 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50523971 - 222 = 46329667 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (50523901) 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 as a sum of consecutive naturals, namely, 25261985 + 25261986.
It is an arithmetic number, because the mean of its divisors is an integer number (25261986).
Almost surely, 250523971 is an apocalyptic number.
50523971 is a deficient number, since it is larger than the sum of its proper divisors (1).
50523971 is an equidigital number, since it uses as much as digits as its factorization.
50523971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9450, while the sum is 32.
The square root of 50523971 is about 7108.0215953527. The cubic root of 50523971 is about 369.6855643673.
The spelling of 50523971 in words is "fifty million, five hundred twenty-three thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •