Base | Representation |
---|---|
bin | 1100110100010011110… |
… | …0011000010011111001 |
3 | 210001101010011120021000 |
4 | 3031010330120103321 |
5 | 12101432200323001 |
6 | 245054122235213 |
7 | 21623522132235 |
oct | 3150474302371 |
9 | 701333146230 |
10 | 220200011001 |
11 | 85428190473 |
12 | 36814655b09 |
13 | 179c32860c9 |
14 | a92cb8d5c5 |
15 | 5adba4ca86 |
hex | 3344f184f9 |
220200011001 has 16 divisors (see below), whose sum is σ = 326301220800. Its totient is φ = 146764465344.
The previous prime is 220200010973. The next prime is 220200011033. The reversal of 220200011001 is 100110002022.
220200011001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 220200011001 - 29 = 220200010489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (220200011051) 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 15 ways as a sum of consecutive naturals, for example, 873456 + ... + 1096961.
It is an arithmetic number, because the mean of its divisors is an integer number (20393826300).
Almost surely, 2220200011001 is an apocalyptic number.
It is an amenable number.
220200011001 is a deficient number, since it is larger than the sum of its proper divisors (106101209799).
220200011001 is a wasteful number, since it uses less digits than its factorization.
220200011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1974565 (or 1974559 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 220200011001 its reverse (100110002022), we get a palindrome (320310013023).
The spelling of 220200011001 in words is "two hundred twenty billion, two hundred million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •