Base | Representation |
---|---|
bin | 1001010110110100011001… |
… | …00111100011000111111000 |
3 | 2200211222022201120121021120 |
4 | 10223122030213203013320 |
5 | 10144101104121304220 |
6 | 111432050204105240 |
7 | 4222340636556435 |
oct | 453321447430770 |
9 | 80758281517246 |
10 | 20575252525560 |
11 | 6612a08722817 |
12 | 2383756535220 |
13 | b63312b22b35 |
14 | 511bc18d0b8c |
15 | 25a3222b3a40 |
hex | 12b68c9e31f8 |
20575252525560 has 32 divisors (see below), whose sum is σ = 61725757577040. Its totient is φ = 5486734006784.
The previous prime is 20575252525523. The next prime is 20575252525561. The reversal of 20575252525560 is 6552525257502.
It is a super-3 number, since 3×205752525255603 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20575252525561) 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 7 ways as a sum of consecutive naturals, for example, 85730218737 + ... + 85730218976.
Almost surely, 220575252525560 is an apocalyptic number.
20575252525560 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20575252525560 is an abundant number, since it is smaller than the sum of its proper divisors (41150505051480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20575252525560 is a wasteful number, since it uses less digits than its factorization.
20575252525560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171460437727 (or 171460437723 counting only the distinct ones).
The product of its (nonzero) digits is 10500000, while the sum is 51.
The spelling of 20575252525560 in words is "twenty trillion, five hundred seventy-five billion, two hundred fifty-two million, five hundred twenty-five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •