Base | Representation |
---|---|
bin | 11000000110110111101101… |
… | …01101100011000101011000 |
3 | 20221200221212000112112010121 |
4 | 30003123312231203011120 |
5 | 23422024324112040202 |
6 | 304425355225123024 |
7 | 14111015164605442 |
oct | 1403336655430530 |
9 | 227627760475117 |
10 | 53012625502552 |
11 | 1598958a0727a1 |
12 | 5b42251029474 |
13 | 23770b8b72141 |
14 | d13b79223492 |
15 | 61dea79cd537 |
hex | 3036f6b63158 |
53012625502552 has 32 divisors (see below), whose sum is σ = 101501144683200. Its totient is φ = 25950507780384.
The previous prime is 53012625502483. The next prime is 53012625502559. The reversal of 53012625502552 is 25520552621035.
53012625502552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 53012625502499 and 53012625502508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53012625502559) 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, 303299602 + ... + 303474337.
It is an arithmetic number, because the mean of its divisors is an integer number (3171910771350).
Almost surely, 253012625502552 is an apocalyptic number.
It is an amenable number.
53012625502552 is a deficient number, since it is larger than the sum of its proper divisors (48488519180648).
53012625502552 is a wasteful number, since it uses less digits than its factorization.
53012625502552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606774175 (or 606774171 counting only the distinct ones).
The product of its (nonzero) digits is 900000, while the sum is 43.
The spelling of 53012625502552 in words is "fifty-three trillion, twelve billion, six hundred twenty-five million, five hundred two thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •