Base | Representation |
---|---|
bin | 10000000001100000000… |
… | …111001000111011111001 |
3 | 10220021012020021120200000 |
4 | 100001200013020323321 |
5 | 121020100233041441 |
6 | 2201503251103213 |
7 | 142360611344235 |
oct | 20014007107371 |
9 | 3807166246600 |
10 | 1101124112121 |
11 | 394a90945080 |
12 | 1594a42a1b09 |
13 | 7cab294bc87 |
14 | 3b41a8c15c5 |
15 | 1d9994eb2b6 |
hex | 100601c8ef9 |
1101124112121 has 24 divisors (see below), whose sum is σ = 1799367801504. Its totient is φ = 667347945120.
The previous prime is 1101124112093. The next prime is 1101124112201. The reversal of 1101124112121 is 1212114211011.
It is not a de Polignac number, because 1101124112121 - 25 = 1101124112089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101124112094 and 1101124112103.
It is not an unprimeable number, because it can be changed into a prime (1101124113121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 205968916 + ... + 205974261.
It is an arithmetic number, because the mean of its divisors is an integer number (74973658396).
Almost surely, 21101124112121 is an apocalyptic number.
1101124112121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1101124112121 is a deficient number, since it is larger than the sum of its proper divisors (698243689383).
1101124112121 is an equidigital number, since it uses as much as digits as its factorization.
1101124112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 411943203 (or 411943191 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 1101124112121 its reverse (1212114211011), we get a palindrome (2313238323132).
The spelling of 1101124112121 in words is "one trillion, one hundred one billion, one hundred twenty-four million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •