Base | Representation |
---|---|
bin | 110001100011000010… |
… | …101110001101111101 |
3 | 12002022200120022100222 |
4 | 301203002232031331 |
5 | 1332424010444113 |
6 | 40235035431125 |
7 | 3562243203263 |
oct | 614302561575 |
9 | 162280508328 |
10 | 53201265533 |
11 | 20620800249 |
12 | a388bb54a5 |
13 | 502b0625a0 |
14 | 2809968433 |
15 | 15b5942e08 |
hex | c630ae37d |
53201265533 has 8 divisors (see below), whose sum is σ = 60309127200. Its totient is φ = 46524183408.
The previous prime is 53201265511. The next prime is 53201265583. The reversal of 53201265533 is 33556210235.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53201265533 - 210 = 53201264509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53201265493 and 53201265502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53201265583) 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 in 7 ways as a sum of consecutive naturals, for example, 107694623 + ... + 107695116.
It is an arithmetic number, because the mean of its divisors is an integer number (7538640900).
Almost surely, 253201265533 is an apocalyptic number.
It is an amenable number.
53201265533 is a deficient number, since it is larger than the sum of its proper divisors (7107861667).
53201265533 is a wasteful number, since it uses less digits than its factorization.
53201265533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215389771.
The product of its (nonzero) digits is 81000, while the sum is 35.
Adding to 53201265533 its reverse (33556210235), we get a palindrome (86757475768).
The spelling of 53201265533 in words is "fifty-three billion, two hundred one million, two hundred sixty-five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •