Base | Representation |
---|---|
bin | 1010000110001010110100… |
… | …1111011100101101101001 |
3 | 1110022020212212220110202000 |
4 | 2201202231033130231221 |
5 | 2423340024103013001 |
6 | 35335435330201213 |
7 | 2224012441050615 |
oct | 241425517345551 |
9 | 43266785813660 |
10 | 11101102001001 |
11 | 359aa50746741 |
12 | 12b3574723209 |
13 | 626aa233519c |
14 | 2a5420ad6345 |
15 | 143b72522a86 |
hex | a18ad3dcb69 |
11101102001001 has 8 divisors (see below), whose sum is σ = 16446077038560. Its totient is φ = 7400734667316.
The previous prime is 11101102000987. The next prime is 11101102001009. The reversal of 11101102001001 is 10010020110111.
It is not a de Polignac number, because 11101102001001 - 231 = 11098954517353 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11101102001009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 205575962955 + ... + 205575963008.
It is an arithmetic number, because the mean of its divisors is an integer number (2055759629820).
Almost surely, 211101102001001 is an apocalyptic number.
It is an amenable number.
11101102001001 is a deficient number, since it is larger than the sum of its proper divisors (5344975037559).
11101102001001 is an equidigital number, since it uses as much as digits as its factorization.
11101102001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411151925972 (or 411151925966 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11101102001001 its reverse (10010020110111), we get a palindrome (21111122111112).
The spelling of 11101102001001 in words is "eleven trillion, one hundred one billion, one hundred two million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •