Base | Representation |
---|---|
bin | 1100001001100… |
… | …0111010010001 |
3 | 10112212221012012 |
4 | 3002120322101 |
5 | 101021123334 |
6 | 5020112305 |
7 | 1156064336 |
oct | 302307221 |
9 | 115787165 |
10 | 50957969 |
11 | 26845527 |
12 | 15095695 |
13 | a73245a |
14 | 6aa698d |
15 | 47189ce |
hex | 3098e91 |
50957969 has 2 divisors, whose sum is σ = 50957970. Its totient is φ = 50957968.
The previous prime is 50957939. The next prime is 50957987. The reversal of 50957969 is 96975905.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 47789569 + 3168400 = 6913^2 + 1780^2 .
It is a cyclic number.
It is not a de Polignac number, because 50957969 - 28 = 50957713 is a prime.
It is a super-2 number, since 2×509579692 = 5193429209209922, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (50957909) 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 as a sum of consecutive naturals, namely, 25478984 + 25478985.
It is an arithmetic number, because the mean of its divisors is an integer number (25478985).
Almost surely, 250957969 is an apocalyptic number.
It is an amenable number.
50957969 is a deficient number, since it is larger than the sum of its proper divisors (1).
50957969 is an equidigital number, since it uses as much as digits as its factorization.
50957969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 765450, while the sum is 50.
The square root of 50957969 is about 7138.4850633730. The cubic root of 50957969 is about 370.7410737564.
The spelling of 50957969 in words is "fifty million, nine hundred fifty-seven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •