Base | Representation |
---|---|
bin | 101101101110011010000110… |
… | …111001101101110010100110 |
3 | 222101001002101221010100220121 |
4 | 231232122012321231302212 |
5 | 202324320300313310042 |
6 | 1551412343114552154 |
7 | 60234040516050505 |
oct | 5556320671556246 |
9 | 871032357110817 |
10 | 201101222010022 |
11 | 59093605143584 |
12 | 1a67a92043865a |
13 | 88299c12968b9 |
14 | 37934cb50a83c |
15 | 183b186e77367 |
hex | b6e686e6dca6 |
201101222010022 has 8 divisors (see below), whose sum is σ = 301696635030336. Its totient is φ = 100535676999912.
The previous prime is 201101222009993. The next prime is 201101222010077. The reversal of 201101222010022 is 220010222101102.
It is a happy number.
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 = 201101222009978 and 201101222010005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7466985718 + ... + 7467012649.
It is an arithmetic number, because the mean of its divisors is an integer number (37712079378792).
Almost surely, 2201101222010022 is an apocalyptic number.
201101222010022 is a deficient number, since it is larger than the sum of its proper divisors (100595413020314).
201101222010022 is a wasteful number, since it uses less digits than its factorization.
201101222010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14934005102.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201101222010022 its reverse (220010222101102), we get a palindrome (421111444111124).
The spelling of 201101222010022 in words is "two hundred one trillion, one hundred one billion, two hundred twenty-two million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •