Base | Representation |
---|---|
bin | 1100001001100… |
… | …0101101010001 |
3 | 10112212220001101 |
4 | 3002120231101 |
5 | 101021112022 |
6 | 5020104401 |
7 | 1156062040 |
oct | 302305521 |
9 | 115786041 |
10 | 50957137 |
11 | 26844940 |
12 | 15095101 |
13 | a731c6a |
14 | 6aa6557 |
15 | 4718627 |
hex | 3098b51 |
50957137 has 16 divisors (see below), whose sum is σ = 65084544. Its totient is φ = 38736000.
The previous prime is 50957131. The next prime is 50957161. The reversal of 50957137 is 73175905.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 50957137 - 23 = 50957129 is a prime.
It is a super-2 number, since 2×509571372 = 5193259622473538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50957096 and 50957105.
It is not an unprimeable number, because it can be changed into a prime (50957131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4914 + ... + 11227.
It is an arithmetic number, because the mean of its divisors is an integer number (4067784).
Almost surely, 250957137 is an apocalyptic number.
It is an amenable number.
50957137 is a deficient number, since it is larger than the sum of its proper divisors (14127407).
50957137 is a wasteful number, since it uses less digits than its factorization.
50957137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16200.
The product of its (nonzero) digits is 33075, while the sum is 37.
The square root of 50957137 is about 7138.4267874651. The cubic root of 50957137 is about 370.7390560265.
The spelling of 50957137 in words is "fifty million, nine hundred fifty-seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •