Base | Representation |
---|---|
bin | 101110100100010001… |
… | …000111010011100011 |
3 | 11210001121221011000121 |
4 | 232210101013103203 |
5 | 1304400122340201 |
6 | 34545302101111 |
7 | 3420030001006 |
oct | 564421072343 |
9 | 153047834017 |
10 | 50000590051 |
11 | 1a2290363a5 |
12 | 983511a797 |
13 | 493ac18479 |
14 | 25c484553d |
15 | 147995e9a1 |
hex | ba44474e3 |
50000590051 has 2 divisors, whose sum is σ = 50000590052. Its totient is φ = 50000590050.
The previous prime is 50000590039. The next prime is 50000590069. The reversal of 50000590051 is 15009500005.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50000590051 - 29 = 50000589539 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50000589998 and 50000590025.
It is not a weakly prime, because it can be changed into another prime (50000590751) 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, 25000295025 + 25000295026.
It is an arithmetic number, because the mean of its divisors is an integer number (25000295026).
Almost surely, 250000590051 is an apocalyptic number.
50000590051 is a deficient number, since it is larger than the sum of its proper divisors (1).
50000590051 is an equidigital number, since it uses as much as digits as its factorization.
50000590051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1125, while the sum is 25.
The spelling of 50000590051 in words is "fifty billion, five hundred ninety thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •