Base | Representation |
---|---|
bin | 1010000001100000111000… |
… | …0100011000001011111001 |
3 | 1110000121102221122001101020 |
4 | 2200120032010120023321 |
5 | 2421032224230011301 |
6 | 35235011131413053 |
7 | 2215151452151460 |
oct | 240301604301371 |
9 | 43017387561336 |
10 | 11021122110201 |
11 | 356a039124a35 |
12 | 129bb735b4189 |
13 | 61c397421408 |
14 | 2a15d48b39d7 |
15 | 141a40bc7436 |
hex | a060e1182f9 |
11021122110201 has 32 divisors (see below), whose sum is σ = 17336113766400. Its totient is φ = 6094531981440.
The previous prime is 11021122110199. The next prime is 11021122110221. The reversal of 11021122110201 is 10201122112011.
It is a happy number.
It is not a de Polignac number, because 11021122110201 - 21 = 11021122110199 is a prime.
It is a super-2 number, since 2×110211221102012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11021122110221) 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 31 ways as a sum of consecutive naturals, for example, 63046045 + ... + 63220613.
It is an arithmetic number, because the mean of its divisors is an integer number (541753555200).
Almost surely, 211021122110201 is an apocalyptic number.
It is an amenable number.
11021122110201 is a deficient number, since it is larger than the sum of its proper divisors (6314991656199).
11021122110201 is a wasteful number, since it uses less digits than its factorization.
11021122110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271589.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11021122110201 its reverse (10201122112011), we get a palindrome (21222244222212).
The spelling of 11021122110201 in words is "eleven trillion, twenty-one billion, one hundred twenty-two million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •