Base | Representation |
---|---|
bin | 110001010111110011… |
… | …001001101000011101 |
3 | 12001211112121211202010 |
4 | 301113303021220131 |
5 | 1332032213243031 |
6 | 40204220421433 |
7 | 3554462645445 |
oct | 612763115035 |
9 | 161745554663 |
10 | 53012634141 |
11 | 20534282735 |
12 | a3359a7879 |
13 | 4ccac58a8c |
14 | 27cc8a5125 |
15 | 15a40d2246 |
hex | c57cc9a1d |
53012634141 has 32 divisors (see below), whose sum is σ = 75119385600. Its totient is φ = 33161063040.
The previous prime is 53012634139. The next prime is 53012634161. The reversal of 53012634141 is 14143621035.
It is not a de Polignac number, because 53012634141 - 21 = 53012634139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53012634099 and 53012634108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53012634161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2664930 + ... + 2684748.
It is an arithmetic number, because the mean of its divisors is an integer number (2347480800).
Almost surely, 253012634141 is an apocalyptic number.
It is an amenable number.
53012634141 is a deficient number, since it is larger than the sum of its proper divisors (22106751459).
53012634141 is a wasteful number, since it uses less digits than its factorization.
53012634141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20289.
The product of its (nonzero) digits is 8640, while the sum is 30.
The spelling of 53012634141 in words is "fifty-three billion, twelve million, six hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •