Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …100111111101001001000 |
3 | 10220011121022221211221111 |
4 | 100000210110333221020 |
5 | 121011022001023422 |
6 | 2201215541220104 |
7 | 142324012104112 |
oct | 20004424775110 |
9 | 3804538854844 |
10 | 1100121111112 |
11 | 394616761621 |
12 | 159264401634 |
13 | 7c982c00b5a |
14 | 3b3635d23b2 |
15 | 1d93b425a77 |
hex | 1002453fa48 |
1100121111112 has 64 divisors (see below), whose sum is σ = 2271084706800. Its totient is φ = 497261936640.
The previous prime is 1100121111107. The next prime is 1100121111113. The reversal of 1100121111112 is 2111111210011.
It can be written as a sum of positive squares in 8 ways, for example, as 486458821156 + 613662289956 = 697466^2 + 783366^2 .
It is a super-2 number, since 2×11001211111122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100121111092 and 1100121111101.
It is not an unprimeable number, because it can be changed into a prime (1100121111113) 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, 38562 + ... + 1483822.
Almost surely, 21100121111112 is an apocalyptic number.
It is an amenable number.
1100121111112 is an abundant number, since it is smaller than the sum of its proper divisors (1170963595688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100121111112 is a wasteful number, since it uses less digits than its factorization.
1100121111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1445506 (or 1445502 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1100121111112 its reverse (2111111210011), we get a palindrome (3211232321123).
The spelling of 1100121111112 in words is "one trillion, one hundred billion, one hundred twenty-one million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •