Base | Representation |
---|---|
bin | 10000010100000111111… |
… | …101110010001011101101 |
3 | 10222011210210021001211110 |
4 | 100110013331302023231 |
5 | 121332023221213401 |
6 | 2215011354342233 |
7 | 143666254424220 |
oct | 20240775621355 |
9 | 3864723231743 |
10 | 1121120101101 |
11 | 3a2512084600 |
12 | 161344a2a979 |
13 | 8194b551010 |
14 | 3c3964415b7 |
15 | 1e269c239d6 |
hex | 10507f722ed |
1121120101101 has 96 divisors (see below), whose sum is σ = 2076902566144. Its totient is φ = 523069747200.
The previous prime is 1121120101043. The next prime is 1121120101133. The reversal of 1121120101101 is 1011010211211.
It is not a de Polignac number, because 1121120101101 - 211 = 1121120099053 is a prime.
It is a super-2 number, since 2×11211201011012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121120101501) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 763581 + ... + 1680861.
Almost surely, 21121120101101 is an apocalyptic number.
1121120101101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1121120101101 is a deficient number, since it is larger than the sum of its proper divisors (955782465043).
1121120101101 is a wasteful number, since it uses less digits than its factorization.
1121120101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 917363 (or 917352 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1121120101101 its reverse (1011010211211), we get a palindrome (2132130312312).
It can be divided in two parts, 1121120 and 101101, that added together give a palindrome (1222221).
The spelling of 1121120101101 in words is "one trillion, one hundred twenty-one billion, one hundred twenty million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •