Base | Representation |
---|---|
bin | 1010000001100100001110… |
… | …1101111111101000000101 |
3 | 1110000200202200022222001122 |
4 | 2200121003231333220011 |
5 | 2421041100141241401 |
6 | 35235240324003325 |
7 | 2215212661663325 |
oct | 240310355775005 |
9 | 43020680288048 |
10 | 11022022212101 |
11 | 356a4602168aa |
12 | 12a0184b30545 |
13 | 61c4aba522a4 |
14 | 2a167c259285 |
15 | 141a94c2421b |
hex | a0643b7fa05 |
11022022212101 has 8 divisors (see below), whose sum is σ = 11057924739264. Its totient is φ = 10986122646720.
The previous prime is 11022022212041. The next prime is 11022022212109. The reversal of 11022022212101 is 10121222022011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11022022212101 - 230 = 11020948470277 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11022022212101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022022212109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6840686 + ... + 8296928.
It is an arithmetic number, because the mean of its divisors is an integer number (1382240592408).
Almost surely, 211022022212101 is an apocalyptic number.
It is an amenable number.
11022022212101 is a deficient number, since it is larger than the sum of its proper divisors (35902527163).
11022022212101 is a wasteful number, since it uses less digits than its factorization.
11022022212101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1480891.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11022022212101 its reverse (10121222022011), we get a palindrome (21143244234112).
The spelling of 11022022212101 in words is "eleven trillion, twenty-two billion, twenty-two million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •