Base | Representation |
---|---|
bin | 1011111011001… |
… | …0111101111001 |
3 | 10111010002012221 |
4 | 2332302331321 |
5 | 100301003441 |
6 | 4544004041 |
7 | 1145062411 |
oct | 276627571 |
9 | 114102187 |
10 | 50016121 |
11 | 26261941 |
12 | 14900621 |
13 | a49284c |
14 | 68dd641 |
15 | 45ce8d1 |
hex | 2fb2f79 |
50016121 has 2 divisors, whose sum is σ = 50016122. Its totient is φ = 50016120.
The previous prime is 50016107. The next prime is 50016137. The reversal of 50016121 is 12161005.
It is a happy number.
It is an a-pointer prime, because the next prime (50016137) can be obtained adding 50016121 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32080896 + 17935225 = 5664^2 + 4235^2 .
It is a cyclic number.
It is not a de Polignac number, because 50016121 - 27 = 50015993 is a prime.
It is a super-2 number, since 2×500161212 = 5003224719773282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50016095 and 50016104.
It is not a weakly prime, because it can be changed into another prime (50016101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25008060 + 25008061.
It is an arithmetic number, because the mean of its divisors is an integer number (25008061).
Almost surely, 250016121 is an apocalyptic number.
It is an amenable number.
50016121 is a deficient number, since it is larger than the sum of its proper divisors (1).
50016121 is an equidigital number, since it uses as much as digits as its factorization.
50016121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 50016121 is about 7072.2076468384. The cubic root of 50016121 is about 368.4427391241.
Adding to 50016121 its reverse (12161005), we get a palindrome (62177126).
The spelling of 50016121 in words is "fifty million, sixteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •