Base | Representation |
---|---|
bin | 110001010111111000… |
… | …000101000011110100 |
3 | 12001211122001111000122 |
4 | 301113320011003310 |
5 | 1332033031114012 |
6 | 40204304231112 |
7 | 3554506636256 |
oct | 612770050364 |
9 | 161748044018 |
10 | 53013926132 |
11 | 20534a853a2 |
12 | a33630b498 |
13 | 4ccb2bbb7b |
14 | 27ccb1dcd6 |
15 | 15a4289e72 |
hex | c57e050f4 |
53013926132 has 6 divisors (see below), whose sum is σ = 92774370738. Its totient is φ = 26506963064.
The previous prime is 53013926117. The next prime is 53013926183. The reversal of 53013926132 is 23162931035.
It can be written as a sum of positive squares in only one way, i.e., 48705841636 + 4308084496 = 220694^2 + 65636^2 .
It is a junction number, because it is equal to n+sod(n) for n = 53013926092 and 53013926101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6626740763 + ... + 6626740770.
It is an arithmetic number, because the mean of its divisors is an integer number (15462395123).
Almost surely, 253013926132 is an apocalyptic number.
It is an amenable number.
53013926132 is a deficient number, since it is larger than the sum of its proper divisors (39760444606).
53013926132 is a wasteful number, since it uses less digits than its factorization.
53013926132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13253481537 (or 13253481535 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 35.
The spelling of 53013926132 in words is "fifty-three billion, thirteen million, nine hundred twenty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •