Base | Representation |
---|---|
bin | 110001011000100100… |
… | …001110101101011111 |
3 | 12001212102211111101101 |
4 | 301120210032231133 |
5 | 1332044011444444 |
6 | 40205400253531 |
7 | 3555010212313 |
oct | 613044165537 |
9 | 161772744341 |
10 | 53025499999 |
11 | 2054056aa7a |
12 | a33a1712a7 |
13 | 5000811c04 |
14 | 27d0493b43 |
15 | 15a52c43d4 |
hex | c5890eb5f |
53025499999 has 2 divisors, whose sum is σ = 53025500000. Its totient is φ = 53025499998.
The previous prime is 53025499913. The next prime is 53025500041. The reversal of 53025499999 is 99999452035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53025499999 - 211 = 53025497951 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53025499999.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53025499099) 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, 26512749999 + 26512750000.
It is an arithmetic number, because the mean of its divisors is an integer number (26512750000).
Almost surely, 253025499999 is an apocalyptic number.
53025499999 is a deficient number, since it is larger than the sum of its proper divisors (1).
53025499999 is an equidigital number, since it uses as much as digits as its factorization.
53025499999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35429400, while the sum is 64.
The spelling of 53025499999 in words is "fifty-three billion, twenty-five million, four hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •