Base | Representation |
---|---|
bin | 110001011010010100… |
… | …111101000100101001 |
3 | 12001221111102210101210 |
4 | 301122110331010221 |
5 | 1332124043100100 |
6 | 40212333503333 |
7 | 3555516325065 |
oct | 613224750451 |
9 | 161844383353 |
10 | 53055050025 |
11 | 2055621338a |
12 | a348041b49 |
13 | 500698a133 |
14 | 27d4386aa5 |
15 | 15a7baec50 |
hex | c5a53d129 |
53055050025 has 48 divisors (see below), whose sum is σ = 88902792000. Its totient is φ = 27915744000.
The previous prime is 53055050003. The next prime is 53055050029. The reversal of 53055050025 is 52005055035.
It is not a de Polignac number, because 53055050025 - 213 = 53055041833 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 53055049974 and 53055050001.
It is not an unprimeable number, because it can be changed into a prime (53055050029) 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 in 47 ways as a sum of consecutive naturals, for example, 2131351 + ... + 2156099.
It is an arithmetic number, because the mean of its divisors is an integer number (1852141500).
Almost surely, 253055050025 is an apocalyptic number.
It is an amenable number.
53055050025 is a deficient number, since it is larger than the sum of its proper divisors (35847741975).
53055050025 is a wasteful number, since it uses less digits than its factorization.
53055050025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25146 (or 25141 counting only the distinct ones).
The product of its (nonzero) digits is 18750, while the sum is 30.
The spelling of 53055050025 in words is "fifty-three billion, fifty-five million, fifty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •