Base | Representation |
---|---|
bin | 11000000111111101011010… |
… | …11000111000110101111011 |
3 | 20221211112110012102210111222 |
4 | 30003332231120320311323 |
5 | 23423133000303234142 |
6 | 304454505003142255 |
7 | 14113511460216416 |
oct | 1403765530706573 |
9 | 227745405383458 |
10 | 53050050055547 |
11 | 159a3444276336 |
12 | 5b4955651498b |
13 | 237a7a149a35c |
14 | d158c9740b7d |
15 | 61ee48334bd2 |
hex | 303fad638d7b |
53050050055547 has 2 divisors, whose sum is σ = 53050050055548. Its totient is φ = 53050050055546.
The previous prime is 53050050055501. The next prime is 53050050055567. The reversal of 53050050055547 is 74555005005035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53050050055547 - 214 = 53050050039163 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53050050055498 and 53050050055507.
It is not a weakly prime, because it can be changed into another prime (53050050055567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26525025027773 + 26525025027774.
It is an arithmetic number, because the mean of its divisors is an integer number (26525025027774).
Almost surely, 253050050055547 is an apocalyptic number.
53050050055547 is a deficient number, since it is larger than the sum of its proper divisors (1).
53050050055547 is an equidigital number, since it uses as much as digits as its factorization.
53050050055547 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1312500, while the sum is 44.
The spelling of 53050050055547 in words is "fifty-three trillion, fifty billion, fifty million, fifty-five thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •