Base | Representation |
---|---|
bin | 1100110011101001000… |
… | …1100000101100110010 |
3 | 210000220122022220201100 |
4 | 3030322101200230302 |
5 | 12101100334013020 |
6 | 245024245345230 |
7 | 21616216436226 |
oct | 3147221405462 |
9 | 700818286640 |
10 | 220021001010 |
11 | 85346134628 |
12 | 36784708216 |
13 | 1799516aa35 |
14 | a9130b2786 |
15 | 5acae8ca90 |
hex | 333a460b32 |
220021001010 has 24 divisors (see below), whose sum is σ = 572054602860. Its totient is φ = 58672266912.
The previous prime is 220021000999. The next prime is 220021001027. The reversal of 220021001010 is 10100120022.
It can be written as a sum of positive squares in 2 ways, for example, as 186269064921 + 33751936089 = 431589^2 + 183717^2 .
It is a super-7 number, since 7×2200210010107 (a number of 81 digits) contains 7777777 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 220021000983 and 220021001001.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 1222338805 + ... + 1222338984.
Almost surely, 2220021001010 is an apocalyptic number.
220021001010 is an abundant number, since it is smaller than the sum of its proper divisors (352033601850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220021001010 is a wasteful number, since it uses less digits than its factorization.
220021001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2444677802 (or 2444677799 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 220021001010 its reverse (10100120022), we get a palindrome (230121121032).
The spelling of 220021001010 in words is "two hundred twenty billion, twenty-one million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •