Base | Representation |
---|---|
bin | 11000010101100100010011… |
… | …11101110110011100101000 |
3 | 21000111020022001200201022110 |
4 | 30022302021331312130220 |
5 | 24003313024420404202 |
6 | 305453352131322320 |
7 | 14162343124325025 |
oct | 1412621175663450 |
9 | 230436261621273 |
10 | 53517607200552 |
11 | 16063765077680 |
12 | 60040a24503a0 |
13 | 23b28c51111c1 |
14 | d303a1d0254c |
15 | 62c1b0b5026c |
hex | 30ac89f76728 |
53517607200552 has 32 divisors (see below), whose sum is σ = 145957110547680. Its totient is φ = 16217456727360.
The previous prime is 53517607200509. The next prime is 53517607200559. The reversal of 53517607200552 is 25500270671535.
53517607200552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (53517607200559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 101359104283 + ... + 101359104810.
It is an arithmetic number, because the mean of its divisors is an integer number (4561159704615).
Almost surely, 253517607200552 is an apocalyptic number.
It is an amenable number.
53517607200552 is an abundant number, since it is smaller than the sum of its proper divisors (92439503347128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53517607200552 is a wasteful number, since it uses less digits than its factorization.
53517607200552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202718209113 (or 202718209109 counting only the distinct ones).
The product of its (nonzero) digits is 2205000, while the sum is 48.
The spelling of 53517607200552 in words is "fifty-three trillion, five hundred seventeen billion, six hundred seven million, two hundred thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •