Base | Representation |
---|---|
bin | 1010000111011000101110… |
… | …0001110000010111000001 |
3 | 1110101020212002021101220121 |
4 | 2201312023201300113001 |
5 | 2424210334332224301 |
6 | 35353214215140241 |
7 | 2225352543313252 |
oct | 241661341602701 |
9 | 43336762241817 |
10 | 11122011211201 |
11 | 35a8900418850 |
12 | 12b762b074681 |
13 | 628a551ac707 |
14 | 2a6445a54b29 |
15 | 144497ed93a1 |
hex | a1d8b8705c1 |
11122011211201 has 16 divisors (see below), whose sum is σ = 12183523732800. Its totient is φ = 10068982862400.
The previous prime is 11122011211141. The next prime is 11122011211219. The reversal of 11122011211201 is 10211211022111.
It is not a de Polignac number, because 11122011211201 - 29 = 11122011210689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11122011211301) 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 15 ways as a sum of consecutive naturals, for example, 737715 + ... + 4773703.
It is an arithmetic number, because the mean of its divisors is an integer number (761470233300).
Almost surely, 211122011211201 is an apocalyptic number.
11122011211201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11122011211201 is a deficient number, since it is larger than the sum of its proper divisors (1061512521599).
11122011211201 is a wasteful number, since it uses less digits than its factorization.
11122011211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4037040.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11122011211201 its reverse (10211211022111), we get a palindrome (21333222233312).
The spelling of 11122011211201 in words is "eleven trillion, one hundred twenty-two billion, eleven million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •