Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …110110101000100010001 |
3 | 10220021102100212101121020 |
4 | 100001211112311010101 |
5 | 121020240300023441 |
6 | 2201520113150053 |
7 | 142363030334133 |
oct | 20014526650421 |
9 | 3807370771536 |
10 | 1101212111121 |
11 | 39502658a021 |
12 | 15950985b329 |
13 | 7cac7c501a5 |
14 | 3b42846b053 |
15 | 1d9a20cee66 |
hex | 100655b5111 |
1101212111121 has 8 divisors (see below), whose sum is σ = 1468677635520. Its totient is φ = 733943997072.
The previous prime is 1101212111081. The next prime is 1101212111141. The reversal of 1101212111121 is 1211112121011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1101212111121 - 215 = 1101212078353 is a prime.
It is a super-2 number, since 2×11012121111212 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1101212111121.
It is not an unprimeable number, because it can be changed into a prime (1101212111141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49339570 + ... + 49361883.
It is an arithmetic number, because the mean of its divisors is an integer number (183584704440).
Almost surely, 21101212111121 is an apocalyptic number.
It is an amenable number.
1101212111121 is a deficient number, since it is larger than the sum of its proper divisors (367465524399).
1101212111121 is an equidigital number, since it uses as much as digits as its factorization.
1101212111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98705175.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 1101212111121 its reverse (1211112121011), we get a palindrome (2312324232132).
The spelling of 1101212111121 in words is "one trillion, one hundred one billion, two hundred twelve million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •