Base | Representation |
---|---|
bin | 10000000001101010110… |
… | …010110011100100110001 |
3 | 10220021122201111211220202 |
4 | 100001222302303210301 |
5 | 121020432123043441 |
6 | 2201533132244545 |
7 | 142365215600510 |
oct | 20015262634461 |
9 | 3807581454822 |
10 | 1101303331121 |
11 | 395073023a54 |
12 | 159534310755 |
13 | 7cb10b0b516 |
14 | 3b436614677 |
15 | 1d9aa0ed19b |
hex | 1006acb3931 |
1101303331121 has 12 divisors (see below), whose sum is σ = 1315734796992. Its totient is φ = 902931920616.
The previous prime is 1101303331111. The next prime is 1101303331169. The reversal of 1101303331121 is 1211333031011.
It is not a de Polignac number, because 1101303331121 - 230 = 1100229589297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101303331093 and 1101303331102.
It is not an unprimeable number, because it can be changed into a prime (1101303331111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 148700501 + ... + 148707906.
It is an arithmetic number, because the mean of its divisors is an integer number (109644566416).
Almost surely, 21101303331121 is an apocalyptic number.
It is an amenable number.
1101303331121 is a deficient number, since it is larger than the sum of its proper divisors (214431465871).
1101303331121 is an equidigital number, since it uses as much as digits as its factorization.
1101303331121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297408460 (or 297408437 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1101303331121 its reverse (1211333031011), we get a palindrome (2312636362132).
The spelling of 1101303331121 in words is "one trillion, one hundred one billion, three hundred three million, three hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •