Base | Representation |
---|---|
bin | 1011101101001010001… |
… | …1100001010000001110 |
3 | 201020002002001102001020 |
4 | 2323102203201100032 |
5 | 11243323330202342 |
6 | 232215020455010 |
7 | 20346320325222 |
oct | 2732243412016 |
9 | 636062042036 |
10 | 201101022222 |
11 | 78317314521 |
12 | 32b843aa466 |
13 | 15c6b46a209 |
14 | 9a3a408782 |
15 | 536ee5d0ec |
hex | 2ed28e140e |
201101022222 has 8 divisors (see below), whose sum is σ = 402202044456. Its totient is φ = 67033674072.
The previous prime is 201101022197. The next prime is 201101022223. The reversal of 201101022222 is 222220101102.
It is a sphenic number, since it is the product of 3 distinct primes.
201101022222 is an admirable number.
It is a super-2 number, since 2×2011010222222 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201101022223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16758418513 + ... + 16758418524.
It is an arithmetic number, because the mean of its divisors is an integer number (50275255557).
Almost surely, 2201101022222 is an apocalyptic number.
201101022222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201101022222 is a wasteful number, since it uses less digits than its factorization.
201101022222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33516837042.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 201101022222 its reverse (222220101102), we get a palindrome (423321123324).
The spelling of 201101022222 in words is "two hundred one billion, one hundred one million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •