Base | Representation |
---|---|
bin | 1001011001000101001110… |
… | …11000110000000101000001 |
3 | 2201010102000211221112202001 |
4 | 10230202213120300011001 |
5 | 10201334331311331000 |
6 | 111531510131024001 |
7 | 4231062603216403 |
oct | 454424730600501 |
9 | 81112024845661 |
10 | 20653011042625 |
11 | 6642990346565 |
12 | 239683773b001 |
13 | b6a755760790 |
14 | 51587aab0b73 |
15 | 25c373abe46a |
hex | 12c8a7630141 |
20653011042625 has 16 divisors (see below), whose sum is σ = 27757646843472. Its totient is φ = 15251454307200.
The previous prime is 20653011042613. The next prime is 20653011042649. The reversal of 20653011042625 is 52624011035602.
It can be written as a sum of positive squares in 8 ways, for example, as 16160086441521 + 4492924601104 = 4019961^2 + 2119652^2 .
It is not a de Polignac number, because 20653011042625 - 27 = 20653011042497 is a prime.
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 in 15 ways as a sum of consecutive naturals, for example, 6354771004 + ... + 6354774253.
It is an arithmetic number, because the mean of its divisors is an integer number (1734852927717).
Almost surely, 220653011042625 is an apocalyptic number.
20653011042625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20653011042625 is a deficient number, since it is larger than the sum of its proper divisors (7104635800847).
20653011042625 is a wasteful number, since it uses less digits than its factorization.
20653011042625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12709545285 (or 12709545275 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 37.
The spelling of 20653011042625 in words is "twenty trillion, six hundred fifty-three billion, eleven million, forty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •