Base | Representation |
---|---|
bin | 101110100111010001… |
… | …011010011101100001 |
3 | 11210012010210020200201 |
4 | 232213101122131201 |
5 | 1310001024001121 |
6 | 34554302345201 |
7 | 3421211324161 |
oct | 564721323541 |
9 | 153163706621 |
10 | 50051000161 |
11 | 1a254537248 |
12 | 9849b8b201 |
13 | 49484b8436 |
14 | 25cb4085a1 |
15 | 147e0bae91 |
hex | ba745a761 |
50051000161 has 2 divisors, whose sum is σ = 50051000162. Its totient is φ = 50051000160.
The previous prime is 50051000119. The next prime is 50051000171. The reversal of 50051000161 is 16100015005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 44076483136 + 5974517025 = 209944^2 + 77295^2 .
It is a cyclic number.
It is not a de Polignac number, because 50051000161 - 219 = 50050475873 is a prime.
It is not a weakly prime, because it can be changed into another prime (50051000171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25025500080 + 25025500081.
It is an arithmetic number, because the mean of its divisors is an integer number (25025500081).
Almost surely, 250051000161 is an apocalyptic number.
It is an amenable number.
50051000161 is a deficient number, since it is larger than the sum of its proper divisors (1).
50051000161 is an equidigital number, since it uses as much as digits as its factorization.
50051000161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 50051000161 its reverse (16100015005), we get a palindrome (66151015166).
The spelling of 50051000161 in words is "fifty billion, fifty-one million, one hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •