Base | Representation |
---|---|
bin | 1010000001100000110101… |
… | …1101111001000011010001 |
3 | 1110000121102020122110212120 |
4 | 2200120031131321003101 |
5 | 2421032214134134301 |
6 | 35235010131244453 |
7 | 2215151300331462 |
oct | 240301535710321 |
9 | 43017366573776 |
10 | 11021112021201 |
11 | 356a033463a17 |
12 | 129bb70149729 |
13 | 61c3952cb1a9 |
14 | 2a15d3408d69 |
15 | 141a3ed82e36 |
hex | a060d7790d1 |
11021112021201 has 32 divisors (see below), whose sum is σ = 14845747392000. Its totient is φ = 7272404101248.
The previous prime is 11021112021197. The next prime is 11021112021203. The reversal of 11021112021201 is 10212021112011.
It is a happy number.
It is not a de Polignac number, because 11021112021201 - 22 = 11021112021197 is a prime.
It is a super-2 number, since 2×110211120212012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11021112021203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 99621045 + ... + 99731613.
It is an arithmetic number, because the mean of its divisors is an integer number (463929606000).
Almost surely, 211021112021201 is an apocalyptic number.
It is an amenable number.
11021112021201 is a deficient number, since it is larger than the sum of its proper divisors (3824635370799).
11021112021201 is a wasteful number, since it uses less digits than its factorization.
11021112021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111613.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11021112021201 its reverse (10212021112011), we get a palindrome (21233133133212).
The spelling of 11021112021201 in words is "eleven trillion, twenty-one billion, one hundred twelve million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •