Base | Representation |
---|---|
bin | 1011111111000… |
… | …0110010110001 |
3 | 10111120221121012 |
4 | 2333300302301 |
5 | 100332104421 |
6 | 4553240305 |
7 | 1150165622 |
oct | 277606261 |
9 | 114527535 |
10 | 50269361 |
11 | 2641512a |
12 | 14a03095 |
13 | a550bac |
14 | 6967a49 |
15 | 462e95b |
hex | 2ff0cb1 |
50269361 has 2 divisors, whose sum is σ = 50269362. Its totient is φ = 50269360.
The previous prime is 50269327. The next prime is 50269381. The reversal of 50269361 is 16396205.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35331136 + 14938225 = 5944^2 + 3865^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50269361 is a prime.
It is a super-3 number, since 3×502693613 (a number of 24 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (50269381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25134680 + 25134681.
It is an arithmetic number, because the mean of its divisors is an integer number (25134681).
Almost surely, 250269361 is an apocalyptic number.
It is an amenable number.
50269361 is a deficient number, since it is larger than the sum of its proper divisors (1).
50269361 is an equidigital number, since it uses as much as digits as its factorization.
50269361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The square root of 50269361 is about 7090.0889275100. The cubic root of 50269361 is about 369.0635216961.
The spelling of 50269361 in words is "fifty million, two hundred sixty-nine thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •