Base | Representation |
---|---|
bin | 110010000100010111001101… |
… | …001001000011100111011011 |
3 | 1001212200010011100112111202120 |
4 | 302010113031021003213123 |
5 | 212330242420210031021 |
6 | 2100155242444432323 |
7 | 64245035545115340 |
oct | 6204271511034733 |
9 | 1055603140474676 |
10 | 220202120002011 |
11 | 641882160a1464 |
12 | 208447905486a3 |
13 | 95b3c80b63c34 |
14 | 3c53ba77387c7 |
15 | 1a6ce685632c6 |
hex | c845cd2439db |
220202120002011 has 16 divisors (see below), whose sum is σ = 344614900802304. Its totient is φ = 122428977915744.
The previous prime is 220202120001961. The next prime is 220202120002043. The reversal of 220202120002011 is 110200021202022.
It is not a de Polignac number, because 220202120002011 - 215 = 220202119969243 is a prime.
It is not an unprimeable number, because it can be changed into a prime (220202120003011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 141700205145 + ... + 141700206698.
It is an arithmetic number, because the mean of its divisors is an integer number (21538431300144).
Almost surely, 2220202120002011 is an apocalyptic number.
220202120002011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
220202120002011 is a deficient number, since it is larger than the sum of its proper divisors (124412780800293).
220202120002011 is a wasteful number, since it uses less digits than its factorization.
220202120002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283400411890.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 220202120002011 its reverse (110200021202022), we get a palindrome (330402141204033).
The spelling of 220202120002011 in words is "two hundred twenty trillion, two hundred two billion, one hundred twenty million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •