Base | Representation |
---|---|
bin | 10011000010010100… |
… | …10010010100011100 |
3 | 222101020202212020001 |
4 | 21201022102110130 |
5 | 131412311133040 |
6 | 4410042304044 |
7 | 511155513436 |
oct | 114112222434 |
9 | 28336685201 |
10 | 10220021020 |
11 | 4374a32070 |
12 | 1b927b8024 |
13 | c6b464621 |
14 | 6cd477656 |
15 | 3ec36e59a |
hex | 26129251c |
10220021020 has 48 divisors (see below), whose sum is σ = 24431113728. Its totient is φ = 3554788160.
The previous prime is 10220021011. The next prime is 10220021057. The reversal of 10220021020 is 2012002201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 10220020988 and 10220021006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1004824 + ... + 1014943.
It is an arithmetic number, because the mean of its divisors is an integer number (508981536).
Almost surely, 210220021020 is an apocalyptic number.
10220021020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10220021020 is an abundant number, since it is smaller than the sum of its proper divisors (14211092708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220021020 is a wasteful number, since it uses less digits than its factorization.
10220021020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2019810 (or 2019808 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10220021020 its reverse (2012002201), we get a palindrome (12232023221).
The spelling of 10220021020 in words is "ten billion, two hundred twenty million, twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •