Base | Representation |
---|---|
bin | 11000000111000111100100… |
… | …11111000010011001110101 |
3 | 20221201202211201120200011111 |
4 | 30003203302133002121311 |
5 | 23422144300444240110 |
6 | 304433324425235021 |
7 | 14111436250236031 |
oct | 1403436237023165 |
9 | 227652751520144 |
10 | 53021144524405 |
11 | 15992160909a22 |
12 | 5b43a2a032a71 |
13 | 2377b45a9a485 |
14 | d143467d51c1 |
15 | 61e30584ce8a |
hex | 3038f27c2675 |
53021144524405 has 128 divisors (see below), whose sum is σ = 69788278619136. Its totient is φ = 38562457190400.
The previous prime is 53021144524391. The next prime is 53021144524463. The reversal of 53021144524405 is 50442544112035.
53021144524405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 53021144524405 - 25 = 53021144524373 is a prime.
It is a super-2 number, since 2×530211445244052 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 10435176465 + ... + 10435181545.
It is an arithmetic number, because the mean of its divisors is an integer number (545220926712).
Almost surely, 253021144524405 is an apocalyptic number.
It is an amenable number.
53021144524405 is a deficient number, since it is larger than the sum of its proper divisors (16767134094731).
53021144524405 is a wasteful number, since it uses less digits than its factorization.
53021144524405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5567.
The product of its (nonzero) digits is 384000, while the sum is 40.
The spelling of 53021144524405 in words is "fifty-three trillion, twenty-one billion, one hundred forty-four million, five hundred twenty-four thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •