Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1110001010111111111001 |
3 | 1110101001200000002021001210 |
4 | 2201310103232022333321 |
5 | 2424142230301400441 |
6 | 35352242533433333 |
7 | 2225251665434532 |
oct | 241642356127771 |
9 | 43331600067053 |
10 | 11120001200121 |
11 | 35a7a69863770 |
12 | 12b7169a9b849 |
13 | 6287c493b748 |
14 | 2a62d4b11689 |
15 | 1443cb7ea616 |
hex | a1d13b8aff9 |
11120001200121 has 16 divisors (see below), whose sum is σ = 17025839159040. Its totient is φ = 6384689683920.
The previous prime is 11120001200117. The next prime is 11120001200131. The reversal of 11120001200121 is 12100210002111.
It is not a de Polignac number, because 11120001200121 - 22 = 11120001200117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11120001200097 and 11120001200106.
It is not an unprimeable number, because it can be changed into a prime (11120001200111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8867623935 + ... + 8867625188.
It is an arithmetic number, because the mean of its divisors is an integer number (1064114947440).
Almost surely, 211120001200121 is an apocalyptic number.
11120001200121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11120001200121 is a deficient number, since it is larger than the sum of its proper divisors (5905837958919).
11120001200121 is a wasteful number, since it uses less digits than its factorization.
11120001200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17735249156.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11120001200121 its reverse (12100210002111), we get a palindrome (23220211202232).
The spelling of 11120001200121 in words is "eleven trillion, one hundred twenty billion, one million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •