Base | Representation |
---|---|
bin | 1010000111010001101011… |
… | …0111111100011000011001 |
3 | 1110101001222100212222222021 |
4 | 2201310122313330120121 |
5 | 2424143002011432301 |
6 | 35352302501454441 |
7 | 2225254653435034 |
oct | 241643267743031 |
9 | 43331870788867 |
10 | 11120121202201 |
11 | 35a8020577040 |
12 | 12b71a2111421 |
13 | 6288137665ab |
14 | 2a6306a2c01b |
15 | 1443d71018a1 |
hex | a1d1adfc619 |
11120121202201 has 16 divisors (see below), whose sum is σ = 12173084979840. Its totient is φ = 10074182152320.
The previous prime is 11120121202199. The next prime is 11120121202231. The reversal of 11120121202201 is 10220212102111.
It is not a de Polignac number, because 11120121202201 - 21 = 11120121202199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11120121202231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12370291 + ... + 13238743.
It is an arithmetic number, because the mean of its divisors is an integer number (760817811240).
Almost surely, 211120121202201 is an apocalyptic number.
11120121202201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11120121202201 is a deficient number, since it is larger than the sum of its proper divisors (1052963777639).
11120121202201 is a wasteful number, since it uses less digits than its factorization.
11120121202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 872496.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11120121202201 its reverse (10220212102111), we get a palindrome (21340333304312).
The spelling of 11120121202201 in words is "eleven trillion, one hundred twenty billion, one hundred twenty-one million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •