Base | Representation |
---|---|
bin | 10010111011110001… |
… | …100100010001101100 |
3 | 1221110211212021112121 |
4 | 102323301210101230 |
5 | 313114012432340 |
6 | 13201202442324 |
7 | 1316541603406 |
oct | 227361442154 |
9 | 57424767477 |
10 | 20330202220 |
11 | 8692961919 |
12 | 3b346633a4 |
13 | 1bbcc1b773 |
14 | dac0bbb76 |
15 | 7dec4394a |
hex | 4bbc6446c |
20330202220 has 24 divisors (see below), whose sum is σ = 42759438624. Its totient is φ = 8119506816.
The previous prime is 20330202203. The next prime is 20330202227. The reversal of 20330202220 is 2220203302.
It is a junction number, because it is equal to n+sod(n) for n = 20330202194 and 20330202203.
It is not an unprimeable number, because it can be changed into a prime (20330202227) 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, 772617 + ... + 798496.
It is an arithmetic number, because the mean of its divisors is an integer number (1781643276).
Almost surely, 220330202220 is an apocalyptic number.
20330202220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20330202220 is an abundant number, since it is smaller than the sum of its proper divisors (22429236404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20330202220 is a wasteful number, since it uses less digits than its factorization.
20330202220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1571769 (or 1571767 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 16.
Adding to 20330202220 its reverse (2220203302), we get a palindrome (22550405522).
The spelling of 20330202220 in words is "twenty billion, three hundred thirty million, two hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •