Base | Representation |
---|---|
bin | 101111111111111100001001… |
… | …101111011101001100101001 |
3 | 1000200110011102101022222200102 |
4 | 233333330021233131030221 |
5 | 210132144100324013001 |
6 | 2024550544423515145 |
7 | 62315423566633040 |
oct | 5777741157351451 |
9 | 1020404371288612 |
10 | 211102101001001 |
11 | 6129999765a521 |
12 | 1b8150025b8ab5 |
13 | 90a3ac5571012 |
14 | 3a1b579287557 |
15 | 19613b4146e6b |
hex | bfff09bdd329 |
211102101001001 has 8 divisors (see below), whose sum is σ = 241263852886080. Its totient is φ = 180941426337168.
The previous prime is 211102101000983. The next prime is 211102101001069. The reversal of 211102101001001 is 100100101201112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211102101001001 - 222 = 211102096806697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211102101001081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 268885331 + ... + 269669288.
It is an arithmetic number, because the mean of its divisors is an integer number (30157981610760).
Almost surely, 2211102101001001 is an apocalyptic number.
It is an amenable number.
211102101001001 is a deficient number, since it is larger than the sum of its proper divisors (30161751885079).
211102101001001 is an equidigital number, since it uses as much as digits as its factorization.
211102101001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538610623.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 211102101001001 its reverse (100100101201112), we get a palindrome (311202202202113).
The spelling of 211102101001001 in words is "two hundred eleven trillion, one hundred two billion, one hundred one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •