Base | Representation |
---|---|
bin | 1010000001100001001111… |
… | …1010100110100110110001 |
3 | 1110000121200210020002112122 |
4 | 2200120103322212212301 |
5 | 2421032424333223441 |
6 | 35235024554204025 |
7 | 2215154053044131 |
oct | 240302372464661 |
9 | 43017623202478 |
10 | 11021220211121 |
11 | 356a08953967a |
12 | 129bba0423615 |
13 | 61c3b184b6b3 |
14 | 2a160392cac1 |
15 | 141a4960434b |
hex | a0613ea69b1 |
11021220211121 has 8 divisors (see below), whose sum is σ = 11038707216000. Its totient is φ = 11003734120960.
The previous prime is 11021220211087. The next prime is 11021220211213. The reversal of 11021220211121 is 12111202212011.
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 11021220211121 - 210 = 11021220210097 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 11021220211121.
It is not an unprimeable number, because it can be changed into a prime (11021220217121) 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, 26329100 + ... + 26744418.
It is an arithmetic number, because the mean of its divisors is an integer number (1379838402000).
Almost surely, 211021220211121 is an apocalyptic number.
It is an amenable number.
11021220211121 is a deficient number, since it is larger than the sum of its proper divisors (17487004879).
11021220211121 is an equidigital number, since it uses as much as digits as its factorization.
11021220211121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 457359.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11021220211121 its reverse (12111202212011), we get a palindrome (23132422423132).
The spelling of 11021220211121 in words is "eleven trillion, twenty-one billion, two hundred twenty million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •