Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …100101001111000111011 |
3 | 10220011121022210022201110 |
4 | 100000210110221320323 |
5 | 121011021440201021 |
6 | 2201215535251403 |
7 | 142324011253254 |
oct | 20004424517073 |
9 | 3804538708643 |
10 | 1100121022011 |
11 | 394616700690 |
12 | 159264379b63 |
13 | 7c982b9c42b |
14 | 3b3635abb2b |
15 | 1d93b409476 |
hex | 10024529e3b |
1100121022011 has 8 divisors (see below), whose sum is σ = 1600176032064. Its totient is φ = 666740013320.
The previous prime is 1100121021973. The next prime is 1100121022031. The reversal of 1100121022011 is 1102201210011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1100121022011 - 29 = 1100121021499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1100121022031) 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, 16668500301 + ... + 16668500366.
It is an arithmetic number, because the mean of its divisors is an integer number (200022004008).
Almost surely, 21100121022011 is an apocalyptic number.
1100121022011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1100121022011 is a deficient number, since it is larger than the sum of its proper divisors (500055010053).
1100121022011 is a wasteful number, since it uses less digits than its factorization.
1100121022011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33337000681.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1100121022011 its reverse (1102201210011), we get a palindrome (2202322232022).
It can be divided in two parts, 11001 and 21022011, that added together give a palindrome (21033012).
The spelling of 1100121022011 in words is "one trillion, one hundred billion, one hundred twenty-one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •