Base | Representation |
---|---|
bin | 10010101001010011… |
… | …100101100111110000 |
3 | 1220200020211100000211 |
4 | 102221103211213300 |
5 | 312000202303040 |
6 | 13110333353504 |
7 | 1306060124416 |
oct | 225123454760 |
9 | 56606740024 |
10 | 20020353520 |
11 | 8543a70a12 |
12 | 3a68938894 |
13 | 1b70982c3b |
14 | d7cca32b6 |
15 | 7c293b8ea |
hex | 4a94e59f0 |
20020353520 has 40 divisors (see below), whose sum is σ = 46783639584. Its totient is φ = 7967484672.
The previous prime is 20020353511. The next prime is 20020353527. The reversal of 20020353520 is 2535302002.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 20020353491 and 20020353500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020353527) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 619404 + ... + 650923.
Almost surely, 220020353520 is an apocalyptic number.
20020353520 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20020353520 is an abundant number, since it is smaller than the sum of its proper divisors (26763286064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020353520 is a wasteful number, since it uses less digits than its factorization.
20020353520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1270537 (or 1270531 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 22.
Adding to 20020353520 its reverse (2535302002), we get a palindrome (22555655522).
The spelling of 20020353520 in words is "twenty billion, twenty million, three hundred fifty-three thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •