Base | Representation |
---|---|
bin | 1011111101000… |
… | …1011011111001 |
3 | 10111100102102011 |
4 | 2333101123321 |
5 | 100314002141 |
6 | 4550405521 |
7 | 1146122305 |
oct | 277213371 |
9 | 114312364 |
10 | 50140921 |
11 | 26337686 |
12 | 149608a1 |
13 | a5075ac |
14 | 6932d05 |
15 | 4606881 |
hex | 2fd16f9 |
50140921 has 2 divisors, whose sum is σ = 50140922. Its totient is φ = 50140920.
The previous prime is 50140891. The next prime is 50140927. The reversal of 50140921 is 12904105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26666896 + 23474025 = 5164^2 + 4845^2 .
It is a cyclic number.
It is not a de Polignac number, because 50140921 - 213 = 50132729 is a prime.
It is a super-2 number, since 2×501409212 = 5028223917456482, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50140892 and 50140901.
It is not a weakly prime, because it can be changed into another prime (50140927) 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, 25070460 + 25070461.
It is an arithmetic number, because the mean of its divisors is an integer number (25070461).
Almost surely, 250140921 is an apocalyptic number.
It is an amenable number.
50140921 is a deficient number, since it is larger than the sum of its proper divisors (1).
50140921 is an equidigital number, since it uses as much as digits as its factorization.
50140921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 22.
The square root of 50140921 is about 7081.0254200928. The cubic root of 50140921 is about 368.7489301511.
Subtracting from 50140921 its product of nonzero digits (360), we obtain a square (50140561 = 70812).
The spelling of 50140921 in words is "fifty million, one hundred forty thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •