Base | Representation |
---|---|
bin | 101111000010010101… |
… | …101101010001000101 |
3 | 11211100210021110002202 |
4 | 233002111231101011 |
5 | 1311413302014342 |
6 | 35111323444245 |
7 | 3435364233254 |
oct | 570225552105 |
9 | 154323243082 |
10 | 50505110597 |
11 | 1a467900127 |
12 | 9956086685 |
13 | 49bb5c4036 |
14 | 263185679b |
15 | 14a8dbc332 |
hex | bc256d445 |
50505110597 has 2 divisors, whose sum is σ = 50505110598. Its totient is φ = 50505110596.
The previous prime is 50505110497. The next prime is 50505110599. The reversal of 50505110597 is 79501150505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38522305441 + 11982805156 = 196271^2 + 109466^2 .
It is a cyclic number.
It is not a de Polignac number, because 50505110597 - 216 = 50505045061 is a prime.
Together with 50505110599, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50505110597.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50505110599) 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, 25252555298 + 25252555299.
It is an arithmetic number, because the mean of its divisors is an integer number (25252555299).
Almost surely, 250505110597 is an apocalyptic number.
It is an amenable number.
50505110597 is a deficient number, since it is larger than the sum of its proper divisors (1).
50505110597 is an equidigital number, since it uses as much as digits as its factorization.
50505110597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39375, while the sum is 38.
The spelling of 50505110597 in words is "fifty billion, five hundred five million, one hundred ten thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •