Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …101110101100111111101 |
3 | 10220011121100101002020201 |
4 | 100000210111311213331 |
5 | 121011022030112341 |
6 | 2201215550043501 |
7 | 142324014014542 |
oct | 20004425654775 |
9 | 3804540332221 |
10 | 1100121332221 |
11 | 3946168a275a |
12 | 1592644a9591 |
13 | 7c982c7a6a2 |
14 | 3b36364cbc9 |
15 | 1d93b46b331 |
hex | 100245759fd |
1100121332221 has 8 divisors (see below), whose sum is σ = 1115665570944. Its totient is φ = 1084578470640.
The previous prime is 1100121332207. The next prime is 1100121332227. The reversal of 1100121332221 is 1222331210011.
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 1100121332221 - 223 = 1100112943613 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100121332227) 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, 1321200 + ... + 1986406.
It is an arithmetic number, because the mean of its divisors is an integer number (139458196368).
Almost surely, 21100121332221 is an apocalyptic number.
It is an amenable number.
1100121332221 is a deficient number, since it is larger than the sum of its proper divisors (15544238723).
1100121332221 is an equidigital number, since it uses as much as digits as its factorization.
1100121332221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688571.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1100121332221 its reverse (1222331210011), we get a palindrome (2322452542232).
The spelling of 1100121332221 in words is "one trillion, one hundred billion, one hundred twenty-one million, three hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •