Base | Representation |
---|---|
bin | 10000000001100101110… |
… | …101101110100100111001 |
3 | 10220021102221002220112210 |
4 | 100001211311232210321 |
5 | 121020244333223001 |
6 | 2201521002525333 |
7 | 142363156231011 |
oct | 20014565564471 |
9 | 3807387086483 |
10 | 1101220211001 |
11 | 395030111639 |
12 | 159510506849 |
13 | 7cac9827c11 |
14 | 3b429578c41 |
15 | 1d9a2b7edd6 |
hex | 10065d6e939 |
1101220211001 has 8 divisors (see below), whose sum is σ = 1493179947360. Its totient is φ = 721703640992.
The previous prime is 1101220210999. The next prime is 1101220211023. The reversal of 1101220211001 is 1001120221011.
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 1101220211001 - 21 = 1101220210999 is a prime.
It is a super-2 number, since 2×11012202110012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1101220211081) 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, 3110791380 + ... + 3110791733.
It is an arithmetic number, because the mean of its divisors is an integer number (186647493420).
Almost surely, 21101220211001 is an apocalyptic number.
It is an amenable number.
1101220211001 is a deficient number, since it is larger than the sum of its proper divisors (391959736359).
1101220211001 is an equidigital number, since it uses as much as digits as its factorization.
1101220211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6221583175.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1101220211001 its reverse (1001120221011), we get a palindrome (2102340432012).
The spelling of 1101220211001 in words is "one trillion, one hundred one billion, two hundred twenty million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •