Base | Representation |
---|---|
bin | 110001011101000000… |
… | …110110001010101101 |
3 | 12002001122020002202121 |
4 | 301131000312022231 |
5 | 1332222112014014 |
6 | 40221023352541 |
7 | 3556604330545 |
oct | 613500661255 |
9 | 162048202677 |
10 | 53100110509 |
11 | 2057969aa56 |
12 | a35b152751 |
13 | 5013106144 |
14 | 27da356325 |
15 | 15abb11124 |
hex | c5d0362ad |
53100110509 has 2 divisors, whose sum is σ = 53100110510. Its totient is φ = 53100110508.
The previous prime is 53100110473. The next prime is 53100110533. The reversal of 53100110509 is 90501100135.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36155881609 + 16944228900 = 190147^2 + 130170^2 .
It is a cyclic number.
It is not a de Polignac number, because 53100110509 - 211 = 53100108461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53100110309) 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, 26550055254 + 26550055255.
It is an arithmetic number, because the mean of its divisors is an integer number (26550055255).
Almost surely, 253100110509 is an apocalyptic number.
It is an amenable number.
53100110509 is a deficient number, since it is larger than the sum of its proper divisors (1).
53100110509 is an equidigital number, since it uses as much as digits as its factorization.
53100110509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 675, while the sum is 25.
The spelling of 53100110509 in words is "fifty-three billion, one hundred million, one hundred ten thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •