Base | Representation |
---|---|
bin | 10111011000001111100101… |
… | …00101101111000001010100 |
3 | 20202000210120110212112112201 |
4 | 23230013302211233001110 |
5 | 23214302233041402040 |
6 | 301201401214254244 |
7 | 13554200642626060 |
oct | 1354076245570124 |
9 | 222023513775481 |
10 | 51410533544020 |
11 | 154210a2a08962 |
12 | 59238577b7384 |
13 | 228bcb9715521 |
14 | c9a3d6b80aa0 |
15 | 5e248c91ea9a |
hex | 2ec1f296f054 |
51410533544020 has 48 divisors (see below), whose sum is σ = 123391815523200. Its totient is φ = 17625535069824.
The previous prime is 51410533543997. The next prime is 51410533544023. The reversal of 51410533544020 is 2044533501415.
51410533544020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51410533544023) 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 15 ways as a sum of consecutive naturals, for example, 7069419 + ... + 12361138.
It is an arithmetic number, because the mean of its divisors is an integer number (2570662823400).
Almost surely, 251410533544020 is an apocalyptic number.
It is an amenable number.
51410533544020 is an abundant number, since it is smaller than the sum of its proper divisors (71981281979180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51410533544020 is a wasteful number, since it uses less digits than its factorization.
51410533544020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19449472 (or 19449470 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 37.
The spelling of 51410533544020 in words is "fifty-one trillion, four hundred ten billion, five hundred thirty-three million, five hundred forty-four thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •