Base | Representation |
---|---|
bin | 110010000001101101101100… |
… | …100000011000101000010011 |
3 | 1001212000201100202210112200010 |
4 | 302001231230200120220103 |
5 | 212314302141141213021 |
6 | 2055535502044530003 |
7 | 64225633302355503 |
oct | 6201555440305023 |
9 | 1055021322715603 |
10 | 220020110101011 |
11 | 6411800626a980 |
12 | 20815455850903 |
13 | 959ca659b986c |
14 | 3c4905ca27a03 |
15 | 1a6836468d976 |
hex | c81b6c818a13 |
220020110101011 has 32 divisors (see below), whose sum is σ = 322154466287616. Its totient is φ = 132460046820000.
The previous prime is 220020110101003. The next prime is 220020110101061. The reversal of 220020110101011 is 110101011020022.
It is not a de Polignac number, because 220020110101011 - 23 = 220020110101003 is a prime.
It is a super-2 number, since 2×2200201101010112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (220020110101061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 298048276 + ... + 298785566.
It is an arithmetic number, because the mean of its divisors is an integer number (10067327071488).
Almost surely, 2220020110101011 is an apocalyptic number.
220020110101011 is a deficient number, since it is larger than the sum of its proper divisors (102134356186605).
220020110101011 is a wasteful number, since it uses less digits than its factorization.
220020110101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 797343.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 220020110101011 its reverse (110101011020022), we get a palindrome (330121121121033).
The spelling of 220020110101011 in words is "two hundred twenty trillion, twenty billion, one hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •