Base | Representation |
---|---|
bin | 100000000001110110011… |
… | …111000100100010100101 |
3 | 21210102012020201100111211 |
4 | 200001312133010202211 |
5 | 242030132321041401 |
6 | 4403044110431421 |
7 | 315006051523534 |
oct | 40016637044245 |
9 | 7712166640454 |
10 | 2201011112101 |
11 | 77949743551a |
12 | 2b66a2202571 |
13 | 12c7291b1519 |
14 | 7875ad7231b |
15 | 3c3c00ca951 |
hex | 200767c48a5 |
2201011112101 has 8 divisors (see below), whose sum is σ = 2211040500480. Its totient is φ = 2190983147232.
The previous prime is 2201011112099. The next prime is 2201011112143. The reversal of 2201011112101 is 1012111101022.
It is a happy number.
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 2201011112101 - 21 = 2201011112099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201011110101) 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 7 ways as a sum of consecutive naturals, for example, 2807430 + ... + 3504808.
It is an arithmetic number, because the mean of its divisors is an integer number (276380062560).
Almost surely, 22201011112101 is an apocalyptic number.
It is an amenable number.
2201011112101 is a deficient number, since it is larger than the sum of its proper divisors (10029388379).
2201011112101 is a wasteful number, since it uses less digits than its factorization.
2201011112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 711755.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2201011112101 its reverse (1012111101022), we get a palindrome (3213122213123).
The spelling of 2201011112101 in words is "two trillion, two hundred one billion, eleven million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •