Base | Representation |
---|---|
bin | 1011111101000… |
… | …0100000101101 |
3 | 10111100020012212 |
4 | 2333100200231 |
5 | 100313342013 |
6 | 4550340205 |
7 | 1146105254 |
oct | 277204055 |
9 | 114306185 |
10 | 50137133 |
11 | 26334852 |
12 | 1495a665 |
13 | a505957 |
14 | 693179b |
15 | 46056a8 |
hex | 2fd082d |
50137133 has 2 divisors, whose sum is σ = 50137134. Its totient is φ = 50137132.
The previous prime is 50137127. The next prime is 50137141. The reversal of 50137133 is 33173105.
It is a happy number.
50137133 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 can be written as a sum of positive squares in only one way, i.e., 30891364 + 19245769 = 5558^2 + 4387^2 .
It is a cyclic number.
It is not a de Polignac number, because 50137133 - 24 = 50137117 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 50137099 and 50137108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50137123) 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, 25068566 + 25068567.
It is an arithmetic number, because the mean of its divisors is an integer number (25068567).
Almost surely, 250137133 is an apocalyptic number.
It is an amenable number.
50137133 is a deficient number, since it is larger than the sum of its proper divisors (1).
50137133 is an equidigital number, since it uses as much as digits as its factorization.
50137133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 945, while the sum is 23.
The square root of 50137133 is about 7080.7579396559. The cubic root of 50137133 is about 368.7396439493.
The spelling of 50137133 in words is "fifty million, one hundred thirty-seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.270 sec. • engine limits •