Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …110110101000010100011 |
3 | 10220021102100212101110011 |
4 | 100001211112311002203 |
5 | 121020240300023021 |
6 | 2201520113145351 |
7 | 142363030333615 |
oct | 20014526650243 |
9 | 3807370771404 |
10 | 1101212111011 |
11 | 395026589a31 |
12 | 15950985b257 |
13 | 7cac7c5011c |
14 | 3b42846adb5 |
15 | 1d9a20cede1 |
hex | 100655b50a3 |
1101212111011 has 4 divisors (see below), whose sum is σ = 1126821695032. Its totient is φ = 1075602526992.
The previous prime is 1101212110979. The next prime is 1101212111047. The reversal of 1101212111011 is 1101112121011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1101212111011 - 25 = 1101212110979 is a prime.
It is a super-2 number, since 2×11012121110112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101212110982 and 1101212111000.
It is not an unprimeable number, because it can be changed into a prime (1101212111071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12804791946 + ... + 12804792031.
It is an arithmetic number, because the mean of its divisors is an integer number (281705423758).
Almost surely, 21101212111011 is an apocalyptic number.
1101212111011 is a deficient number, since it is larger than the sum of its proper divisors (25609584021).
1101212111011 is an equidigital number, since it uses as much as digits as its factorization.
1101212111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25609584020.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1101212111011 its reverse (1101112121011), we get a palindrome (2202324232022).
The spelling of 1101212111011 in words is "one trillion, one hundred one billion, two hundred twelve million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •