Base | Representation |
---|---|
bin | 1100110011100110101… |
… | …1101111011101100010 |
3 | 210000212221200220002100 |
4 | 3030321223233131202 |
5 | 12101040320200002 |
6 | 245023253231230 |
7 | 21616036331301 |
oct | 3147153573542 |
9 | 700787626070 |
10 | 220011100002 |
11 | 85340591881 |
12 | 36781332516 |
13 | 179930b2255 |
14 | a911a56438 |
15 | 5aca18411c |
hex | 3339aef762 |
220011100002 has 96 divisors (see below), whose sum is σ = 494186238000. Its totient is φ = 70685581824.
The previous prime is 220011099947. The next prime is 220011100033. The reversal of 220011100002 is 200001110022.
It can be written as a sum of positive squares in 8 ways, for example, as 203302693881 + 16708406121 = 450891^2 + 129261^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 36489124 + ... + 36495152.
Almost surely, 2220011100002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 220011100002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (247093119000).
220011100002 is an abundant number, since it is smaller than the sum of its proper divisors (274175137998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220011100002 is a wasteful number, since it uses less digits than its factorization.
220011100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6580 (or 6577 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 220011100002 its reverse (200001110022), we get a palindrome (420012210024).
The spelling of 220011100002 in words is "two hundred twenty billion, eleven million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •