Base | Representation |
---|---|
bin | 110010000100100111111000… |
… | …001000010100110111100001 |
3 | 1001212201211100220121111201211 |
4 | 302010213320020110313201 |
5 | 212331041100400200001 |
6 | 2100211403035230121 |
7 | 64246241263000366 |
oct | 6204477010246741 |
9 | 1055654326544654 |
10 | 220220021100001 |
11 | 6419487187231a |
12 | 208481475a8341 |
13 | 95b5874746700 |
14 | 3c549c4d7c46d |
15 | 1a6d664dd2351 |
hex | c849f8214de1 |
220220021100001 has 12 divisors (see below), whose sum is σ = 248831060635008. Its totient is φ = 194441757757104.
The previous prime is 220220021099987. The next prime is 220220021100019. The reversal of 220220021100001 is 100001120022022.
It is a happy number.
It is not a de Polignac number, because 220220021100001 - 239 = 219670265286113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220220021100901) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28327758025 + ... + 28327765798.
It is an arithmetic number, because the mean of its divisors is an integer number (20735921719584).
Almost surely, 2220220021100001 is an apocalyptic number.
It is an amenable number.
220220021100001 is a deficient number, since it is larger than the sum of its proper divisors (28611039535007).
220220021100001 is a wasteful number, since it uses less digits than its factorization.
220220021100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56655523872 (or 56655523859 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 220220021100001 its reverse (100001120022022), we get a palindrome (320221141122023).
The spelling of 220220021100001 in words is "two hundred twenty trillion, two hundred twenty billion, twenty-one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •