Base | Representation |
---|---|
bin | 10000000001100101111… |
… | …000110100000101110110 |
3 | 10220021102222122000022112 |
4 | 100001211320310011312 |
5 | 121020300040120042 |
6 | 2201521032131022 |
7 | 142363166140454 |
oct | 20014570640566 |
9 | 3807388560275 |
10 | 1101221020022 |
11 | 395030614452 |
12 | 159510836a72 |
13 | 7cac9a4c226 |
14 | 3b4297099d4 |
15 | 1d9a2c8e982 |
hex | 10065e34176 |
1101221020022 has 8 divisors (see below), whose sum is σ = 1651901331000. Its totient is φ = 550587243024.
The previous prime is 1101221020021. The next prime is 1101221020033. The reversal of 1101221020022 is 2200201221011.
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 = 1101221019979 and 1101221020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101221020021) 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, 11574272 + ... + 11669027.
It is an arithmetic number, because the mean of its divisors is an integer number (206487666375).
Almost surely, 21101221020022 is an apocalyptic number.
1101221020022 is a deficient number, since it is larger than the sum of its proper divisors (550680310978).
1101221020022 is a wasteful number, since it uses less digits than its factorization.
1101221020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23266990.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1101221020022 its reverse (2200201221011), we get a palindrome (3301422241033).
The spelling of 1101221020022 in words is "one trillion, one hundred one billion, two hundred twenty-one million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •