Base | Representation |
---|---|
bin | 1100110100011001000… |
… | …0010001010000101110 |
3 | 210001102122112211112200 |
4 | 3031012100101100232 |
5 | 12102003313032342 |
6 | 245100225442330 |
7 | 21624210063465 |
oct | 3150620212056 |
9 | 701378484480 |
10 | 220222002222 |
11 | 85439640832 |
12 | 3681baa03a6 |
13 | 179c79b5971 |
14 | a931a759dc |
15 | 5add94394c |
hex | 334641142e |
220222002222 has 24 divisors (see below), whose sum is σ = 490043555976. Its totient is φ = 71423351856.
The previous prime is 220222002149. The next prime is 220222002223. The reversal of 220222002222 is 222200222022.
220222002222 is a `hidden beast` number, since 220 + 2 + 220 + 0 + 2 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 220222002195 and 220222002204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220222002223) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 165331168 + ... + 165332499.
It is an arithmetic number, because the mean of its divisors is an integer number (20418481499).
Almost surely, 2220222002222 is an apocalyptic number.
220222002222 is an abundant number, since it is smaller than the sum of its proper divisors (269821553754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220222002222 is a wasteful number, since it uses less digits than its factorization.
220222002222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330663712 (or 330663709 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 18.
Adding to 220222002222 its reverse (222200222022), we get a palindrome (442422224244).
The spelling of 220222002222 in words is "two hundred twenty billion, two hundred twenty-two million, two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •