Base | Representation |
---|---|
bin | 101101101110011000111110… |
… | …001100100101011111110110 |
3 | 222101000222020220212121121012 |
4 | 231232120332030211133312 |
5 | 202324310301032020042 |
6 | 1551412022102352222 |
7 | 60233665345026443 |
oct | 5556307614453766 |
9 | 871028226777535 |
10 | 201100002220022 |
11 | 59093039650274 |
12 | 1a67a63ba2b672 |
13 | 8829858663779 |
14 | 37934135089ca |
15 | 183b114d2ce82 |
hex | b6e63e3257f6 |
201100002220022 has 8 divisors (see below), whose sum is σ = 301662299087136. Its totient is φ = 100545902524312.
The previous prime is 201100002219979. The next prime is 201100002220057. The reversal of 201100002220022 is 220022200001102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 201100002219979 and 201100002220006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2049231518 + ... + 2049329649.
It is an arithmetic number, because the mean of its divisors is an integer number (37707787385892).
Almost surely, 2201100002220022 is an apocalyptic number.
201100002220022 is a deficient number, since it is larger than the sum of its proper divisors (100562296867114).
201100002220022 is a wasteful number, since it uses less digits than its factorization.
201100002220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4098585702.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 201100002220022 its reverse (220022200001102), we get a palindrome (421122202221124).
The spelling of 201100002220022 in words is "two hundred one trillion, one hundred billion, two million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •