Base | Representation |
---|---|
bin | 110010000011000010010111… |
… | …010001110011011001100001 |
3 | 1001212100102000120121010111120 |
4 | 302003002113101303121201 |
5 | 212322244333113341001 |
6 | 2100045335122402453 |
7 | 64235332214016621 |
oct | 6203022721633141 |
9 | 1055312016533446 |
10 | 220111022012001 |
11 | 6415261870920a |
12 | 2082aba7b00429 |
13 | 95a84c3715b33 |
14 | 3c4d604aa2881 |
15 | 1a6a8d5aeb236 |
hex | c83097473661 |
220111022012001 has 8 divisors (see below), whose sum is σ = 298455623067360. Its totient is φ = 144253551148992.
The previous prime is 220111022011981. The next prime is 220111022012017. The reversal of 220111022012001 is 100210220111022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220111022012001 - 214 = 220111021995617 is a prime.
It is a super-2 number, since 2×2201110220120012 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (220111022012081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 621782547880 + ... + 621782548233.
It is an arithmetic number, because the mean of its divisors is an integer number (37306952883420).
Almost surely, 2220111022012001 is an apocalyptic number.
It is an amenable number.
220111022012001 is a deficient number, since it is larger than the sum of its proper divisors (78344601055359).
220111022012001 is a wasteful number, since it uses less digits than its factorization.
220111022012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1243565096175.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 220111022012001 its reverse (100210220111022), we get a palindrome (320321242123023).
The spelling of 220111022012001 in words is "two hundred twenty trillion, one hundred eleven billion, twenty-two million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •