Base | Representation |
---|---|
bin | 1011111110111… |
… | …1100001001101 |
3 | 10111120200102212 |
4 | 2333233201031 |
5 | 100331423031 |
6 | 4553200205 |
7 | 1150144454 |
oct | 277574115 |
9 | 114520385 |
10 | 50264141 |
11 | 26411214 |
12 | 14a00065 |
13 | a54b6c5 |
14 | 6965b9b |
15 | 462d12b |
hex | 2fef84d |
50264141 has 2 divisors, whose sum is σ = 50264142. Its totient is φ = 50264140.
The previous prime is 50264129. The next prime is 50264153. The reversal of 50264141 is 14146205.
It is a balanced prime because it is at equal distance from previous prime (50264129) and next prime (50264153).
It can be written as a sum of positive squares in only one way, i.e., 41538025 + 8726116 = 6445^2 + 2954^2 .
It is a cyclic number.
It is not a de Polignac number, because 50264141 - 210 = 50263117 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50264111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25132070 + 25132071.
It is an arithmetic number, because the mean of its divisors is an integer number (25132071).
Almost surely, 250264141 is an apocalyptic number.
It is an amenable number.
50264141 is a deficient number, since it is larger than the sum of its proper divisors (1).
50264141 is an equidigital number, since it uses as much as digits as its factorization.
50264141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 50264141 is about 7089.7207984518. The cubic root of 50264141 is about 369.0507466629.
It can be divided in two parts, 50264 and 141, that added together give a palindrome (50405).
The spelling of 50264141 in words is "fifty million, two hundred sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •