Base | Representation |
---|---|
bin | 110010000100010101011010… |
… | …110001000001111011010011 |
3 | 1001212122221012121210020110011 |
4 | 302010111122301001323103 |
5 | 212330230002440213021 |
6 | 2100154324220015351 |
7 | 64244640154534645 |
oct | 6204253261017323 |
9 | 1055587177706404 |
10 | 220200201101011 |
11 | 64187420a0676a |
12 | 20844335991557 |
13 | 95b3a36443261 |
14 | 3c53a64950895 |
15 | 1a6cda4d6ede1 |
hex | c8455ac41ed3 |
220200201101011 has 8 divisors (see below), whose sum is σ = 227304422073344. Its totient is φ = 213096041921160.
The previous prime is 220200201100969. The next prime is 220200201101047. The reversal of 220200201101011 is 110101102002022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220200201101011 - 29 = 220200201100499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220200201100982 and 220200201101000.
It is not an unprimeable number, because it can be changed into a prime (220200201191011) 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, 8151351 + ... + 22513216.
It is an arithmetic number, because the mean of its divisors is an integer number (28413052759168).
Almost surely, 2220200201101011 is an apocalyptic number.
220200201101011 is a deficient number, since it is larger than the sum of its proper divisors (7104220972333).
220200201101011 is a wasteful number, since it uses less digits than its factorization.
220200201101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30896241.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220200201101011 its reverse (110101102002022), we get a palindrome (330301303103033).
The spelling of 220200201101011 in words is "two hundred twenty trillion, two hundred billion, two hundred one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •