Base | Representation |
---|---|
bin | 110010000010111001000010… |
… | …000011010000011110110011 |
3 | 1001212022110011021112222210211 |
4 | 302002321002003100132303 |
5 | 212322113323030413021 |
6 | 2100041000551204551 |
7 | 64234526006023651 |
oct | 6202710203203663 |
9 | 1055273137488724 |
10 | 220101002201011 |
11 | 641493467a2988 |
12 | 20829070376757 |
13 | 95a75878b02a9 |
14 | 3c4cd34063dd1 |
15 | 1a6a4eb1283e1 |
hex | c82e420d07b3 |
220101002201011 has 4 divisors (see below), whose sum is σ = 220101065724232. Its totient is φ = 220100938677792.
The previous prime is 220101002200999. The next prime is 220101002201021. The reversal of 220101002201011 is 110102200101022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 220101002201011 - 217 = 220101002069939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220101002200982 and 220101002201000.
It is not an unprimeable number, because it can be changed into a prime (220101002201021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26244870 + ... + 33600523.
It is an arithmetic number, because the mean of its divisors is an integer number (55025266431058).
Almost surely, 2220101002201011 is an apocalyptic number.
220101002201011 is a deficient number, since it is larger than the sum of its proper divisors (63523221).
220101002201011 is an equidigital number, since it uses as much as digits as its factorization.
220101002201011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63523220.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220101002201011 its reverse (110102200101022), we get a palindrome (330203202302033).
The spelling of 220101002201011 in words is "two hundred twenty trillion, one hundred one billion, two million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •