Base | Representation |
---|---|
bin | 101110100101101110… |
… | …100111100010100001 |
3 | 11210010100001110101001 |
4 | 232211232213202201 |
5 | 1304422411221343 |
6 | 34551535312001 |
7 | 3420445226614 |
oct | 564556474241 |
9 | 153110043331 |
10 | 50025101473 |
11 | 1a240958176 |
12 | 984137b601 |
13 | 494301b179 |
14 | 25c7bc617b |
15 | 147bba244d |
hex | ba5ba78a1 |
50025101473 has 2 divisors, whose sum is σ = 50025101474. Its totient is φ = 50025101472.
The previous prime is 50025101437. The next prime is 50025101521. The reversal of 50025101473 is 37410152005.
It is a happy number.
Together with previous prime (50025101437) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42433116049 + 7591985424 = 205993^2 + 87132^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50025101473 is a prime.
It is not a weakly prime, because it can be changed into another prime (50025101173) 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, 25012550736 + 25012550737.
It is an arithmetic number, because the mean of its divisors is an integer number (25012550737).
Almost surely, 250025101473 is an apocalyptic number.
It is an amenable number.
50025101473 is a deficient number, since it is larger than the sum of its proper divisors (1).
50025101473 is an equidigital number, since it uses as much as digits as its factorization.
50025101473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4200, while the sum is 28.
Adding to 50025101473 its reverse (37410152005), we get a palindrome (87435253478).
The spelling of 50025101473 in words is "fifty billion, twenty-five million, one hundred one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •