Base | Representation |
---|---|
bin | 1010000111010001101011… |
… | …0111100110000111011001 |
3 | 1110101001222100201100212111 |
4 | 2201310122313212013121 |
5 | 2424143002001023001 |
6 | 35352302455512321 |
7 | 2225254652605120 |
oct | 241643267460731 |
9 | 43331870640774 |
10 | 11120121111001 |
11 | 35a8020514571 |
12 | 12b71a20886a1 |
13 | 628813733c26 |
14 | 2a6306a06ab7 |
15 | 1443d70d4851 |
hex | a1d1ade61d9 |
11120121111001 has 16 divisors (see below), whose sum is σ = 12725249817600. Its totient is φ = 9519133029120.
The previous prime is 11120121110999. The next prime is 11120121111049. The reversal of 11120121111001 is 10011112102111.
It is a cyclic number.
It is not a de Polignac number, because 11120121111001 - 21 = 11120121110999 is a prime.
It is a super-2 number, since 2×111201211110012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11120121111061) 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, 23693325 + ... + 24158101.
It is an arithmetic number, because the mean of its divisors is an integer number (795328113600).
Almost surely, 211120121111001 is an apocalyptic number.
It is an amenable number.
11120121111001 is a deficient number, since it is larger than the sum of its proper divisors (1605128706599).
11120121111001 is an equidigital number, since it uses as much as digits as its factorization.
11120121111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469224.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11120121111001 its reverse (10011112102111), we get a palindrome (21131233213112).
The spelling of 11120121111001 in words is "eleven trillion, one hundred twenty billion, one hundred twenty-one million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •