Base | Representation |
---|---|
bin | 1011111100100… |
… | …0011011000001 |
3 | 10111021112202202 |
4 | 2333020123001 |
5 | 100311312001 |
6 | 4545522545 |
7 | 1145606543 |
oct | 277103301 |
9 | 114245682 |
10 | 50104001 |
11 | 26311972 |
12 | 14943455 |
13 | a4c384c |
14 | 6923693 |
15 | 45ea96b |
hex | 2fc86c1 |
50104001 has 2 divisors, whose sum is σ = 50104002. Its totient is φ = 50104000.
The previous prime is 50103983. The next prime is 50104003. The reversal of 50104001 is 10040105.
50104001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50069776 + 34225 = 7076^2 + 185^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50104001 is a prime.
Together with 50104003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (50104003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25052000 + 25052001.
It is an arithmetic number, because the mean of its divisors is an integer number (25052001).
Almost surely, 250104001 is an apocalyptic number.
It is an amenable number.
50104001 is a deficient number, since it is larger than the sum of its proper divisors (1).
50104001 is an equidigital number, since it uses as much as digits as its factorization.
50104001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 11.
The square root of 50104001 is about 7078.4179729654. The cubic root of 50104001 is about 368.6584016094.
Adding to 50104001 its reverse (10040105), we get a palindrome (60144106).
The spelling of 50104001 in words is "fifty million, one hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •