Base | Representation |
---|---|
bin | 10010101000111000… |
… | …000010100110111100 |
3 | 1220122202020110021021 |
4 | 102220320002212330 |
5 | 311441330212340 |
6 | 13105514513524 |
7 | 1305641550154 |
oct | 225070024674 |
9 | 56582213237 |
10 | 20013132220 |
11 | 853a9894a4 |
12 | 3a664358a4 |
13 | 1b6c325093 |
14 | d7bd43764 |
15 | 7c1eb1e4a |
hex | 4a8e029bc |
20013132220 has 12 divisors (see below), whose sum is σ = 42027577704. Its totient is φ = 8005252880.
The previous prime is 20013132199. The next prime is 20013132221. The reversal of 20013132220 is 2223131002.
It is a super-2 number, since 2×200131322202 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20013132194 and 20013132203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20013132221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500328286 + ... + 500328325.
It is an arithmetic number, because the mean of its divisors is an integer number (3502298142).
Almost surely, 220013132220 is an apocalyptic number.
20013132220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20013132220 is an abundant number, since it is smaller than the sum of its proper divisors (22014445484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20013132220 is a wasteful number, since it uses less digits than its factorization.
20013132220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000656620 (or 1000656618 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 20013132220 its reverse (2223131002), we get a palindrome (22236263222).
The spelling of 20013132220 in words is "twenty billion, thirteen million, one hundred thirty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •