Base | Representation |
---|---|
bin | 100000000001111011111… |
… | …010100111101101000101 |
3 | 21210102102121011010012012 |
4 | 200001323322213231011 |
5 | 242030324132020401 |
6 | 4403101123304005 |
7 | 315011236112531 |
oct | 40017372475505 |
9 | 7712377133165 |
10 | 2201102220101 |
11 | 779533903294 |
12 | 2b670881b005 |
13 | 12c742030895 |
14 | 787690cabc1 |
15 | 3c3c80c58bb |
hex | 2007bea7b45 |
2201102220101 has 8 divisors (see below), whose sum is σ = 2250604711680. Its totient is φ = 2152140739632.
The previous prime is 2201102220071. The next prime is 2201102220103. The reversal of 2201102220101 is 1010222011022.
2201102220101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2201102220101 - 238 = 1926224313157 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 (2201102220103) 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, 135244550 + ... + 135260823.
It is an arithmetic number, because the mean of its divisors is an integer number (281325588960).
Almost surely, 22201102220101 is an apocalyptic number.
It is an amenable number.
2201102220101 is a deficient number, since it is larger than the sum of its proper divisors (49502491579).
2201102220101 is a wasteful number, since it uses less digits than its factorization.
2201102220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270505555.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2201102220101 its reverse (1010222011022), we get a palindrome (3211324231123).
The spelling of 2201102220101 in words is "two trillion, two hundred one billion, one hundred two million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •