Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …111001101101100101011 |
3 | 10220021102101001111222220 |
4 | 100001211113031230223 |
5 | 121020240311241021 |
6 | 2201520115245123 |
7 | 142363031234232 |
oct | 20014527155453 |
9 | 3807371044886 |
10 | 1101212212011 |
11 | 3950266488aa |
12 | 1595098a97a3 |
13 | 7cac7c870a2 |
14 | 3b428495b19 |
15 | 1d9a20eecc6 |
hex | 100655cdb2b |
1101212212011 has 8 divisors (see below), whose sum is σ = 1515646915584. Its totient is φ = 710459491560.
The previous prime is 1101212211971. The next prime is 1101212212019. The reversal of 1101212212011 is 1102122121011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1101212212011 is a prime.
It is a super-2 number, since 2×11012122120112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1101212212019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5920495671 + ... + 5920495856.
It is an arithmetic number, because the mean of its divisors is an integer number (189455864448).
Almost surely, 21101212212011 is an apocalyptic number.
1101212212011 is a deficient number, since it is larger than the sum of its proper divisors (414434703573).
1101212212011 is a wasteful number, since it uses less digits than its factorization.
1101212212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11840991561.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1101212212011 its reverse (1102122121011), we get a palindrome (2203334333022).
The spelling of 1101212212011 in words is "one trillion, one hundred one billion, two hundred twelve million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •