Base | Representation |
---|---|
bin | 101110101010001101… |
… | …001001011100010001 |
3 | 11210022120101112201202 |
4 | 232222031021130101 |
5 | 1310101123313041 |
6 | 35003221240545 |
7 | 3422346534311 |
oct | 565215113421 |
9 | 153276345652 |
10 | 50100213521 |
11 | 1a27a29aa46 |
12 | 9862563155 |
13 | 4955759777 |
14 | 25d3b79441 |
15 | 148358ca9b |
hex | baa349711 |
50100213521 has 2 divisors, whose sum is σ = 50100213522. Its totient is φ = 50100213520.
The previous prime is 50100213487. The next prime is 50100213529. The reversal of 50100213521 is 12531200105.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42143573521 + 7956640000 = 205289^2 + 89200^2 .
It is a cyclic number.
It is not a de Polignac number, because 50100213521 - 214 = 50100197137 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 50100213493 and 50100213502.
It is not a weakly prime, because it can be changed into another prime (50100213529) 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, 25050106760 + 25050106761.
It is an arithmetic number, because the mean of its divisors is an integer number (25050106761).
Almost surely, 250100213521 is an apocalyptic number.
It is an amenable number.
50100213521 is a deficient number, since it is larger than the sum of its proper divisors (1).
50100213521 is an equidigital number, since it uses as much as digits as its factorization.
50100213521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 20.
Adding to 50100213521 its reverse (12531200105), we get a palindrome (62631413626).
The spelling of 50100213521 in words is "fifty billion, one hundred million, two hundred thirteen thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •