Base | Representation |
---|---|
bin | 1100000001010… |
… | …1101000101101 |
3 | 10111212121121101 |
4 | 3000111220231 |
5 | 100401422034 |
6 | 5000403101 |
7 | 1151364604 |
oct | 300255055 |
9 | 114777541 |
10 | 50420269 |
11 | 26508549 |
12 | 14a76491 |
13 | a5a47a3 |
14 | 69a6a3b |
15 | 465e514 |
hex | 3015a2d |
50420269 has 2 divisors, whose sum is σ = 50420270. Its totient is φ = 50420268.
The previous prime is 50420267. The next prime is 50420287. The reversal of 50420269 is 96202405.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49070025 + 1350244 = 7005^2 + 1162^2 .
It is a cyclic number.
It is not a de Polignac number, because 50420269 - 21 = 50420267 is a prime.
It is a super-2 number, since 2×504202692 = 5084407052064722, which contains 22 as substring.
Together with 50420267, it forms a pair of twin primes.
It is equal to p3024766 and since 50420269 and 3024766 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50420267) 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, 25210134 + 25210135.
It is an arithmetic number, because the mean of its divisors is an integer number (25210135).
Almost surely, 250420269 is an apocalyptic number.
It is an amenable number.
50420269 is a deficient number, since it is larger than the sum of its proper divisors (1).
50420269 is an equidigital number, since it uses as much as digits as its factorization.
50420269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 50420269 is about 7100.7231321887. The cubic root of 50420269 is about 369.4324608010.
The spelling of 50420269 in words is "fifty million, four hundred twenty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •