Base | Representation |
---|---|
bin | 100000000010000010111… |
… | …111110001011010101001 |
3 | 21210102201212200022211022 |
4 | 200002002333301122221 |
5 | 242031100034323423 |
6 | 4403121005342225 |
7 | 315014210610155 |
oct | 40020277613251 |
9 | 7712655608738 |
10 | 2201221011113 |
11 | 779594969783 |
12 | 2b6740567975 |
13 | 12c760823417 |
14 | 7877abb0065 |
15 | 3c3d373cdc8 |
hex | 20082ff16a9 |
2201221011113 has 64 divisors (see below), whose sum is σ = 2576173248000. Its totient is φ = 1866566467584.
The previous prime is 2201221011089. The next prime is 2201221011127. The reversal of 2201221011113 is 3111101221022.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2201221011113 - 26 = 2201221011049 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2201221011091 and 2201221011100.
It is not an unprimeable number, because it can be changed into a prime (2201221011133) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 661224233 + ... + 661227561.
It is an arithmetic number, because the mean of its divisors is an integer number (40252707000).
Almost surely, 22201221011113 is an apocalyptic number.
It is an amenable number.
2201221011113 is a deficient number, since it is larger than the sum of its proper divisors (374952236887).
2201221011113 is a wasteful number, since it uses less digits than its factorization.
2201221011113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4434.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 2201221011113 its reverse (3111101221022), we get a palindrome (5312322232135).
The spelling of 2201221011113 in words is "two trillion, two hundred one billion, two hundred twenty-one million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •