Base | Representation |
---|---|
bin | 110001011011011001… |
… | …011001100100101000 |
3 | 12001222202012100220211 |
4 | 301123121121210220 |
5 | 1332143141230202 |
6 | 40214214230504 |
7 | 3556124664466 |
oct | 613331314450 |
9 | 161882170824 |
10 | 53072992552 |
11 | 20565358918 |
12 | a352055434 |
13 | 500a5ccc08 |
14 | 27d68d7836 |
15 | 15a95561d7 |
hex | c5b659928 |
53072992552 has 32 divisors (see below), whose sum is σ = 99776649600. Its totient is φ = 26465984064.
The previous prime is 53072992549. The next prime is 53072992559. The reversal of 53072992552 is 25529927035.
It is a junction number, because it is equal to n+sod(n) for n = 53072992496 and 53072992505.
It is not an unprimeable number, because it can be changed into a prime (53072992559) 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 7 ways as a sum of consecutive naturals, for example, 4971973 + ... + 4982635.
It is an arithmetic number, because the mean of its divisors is an integer number (3118020300).
Almost surely, 253072992552 is an apocalyptic number.
It is an amenable number.
53072992552 is a deficient number, since it is larger than the sum of its proper divisors (46703657048).
53072992552 is a wasteful number, since it uses less digits than its factorization.
53072992552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12265 (or 12261 counting only the distinct ones).
The product of its (nonzero) digits is 1701000, while the sum is 49.
The spelling of 53072992552 in words is "fifty-three billion, seventy-two million, nine hundred ninety-two thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •