Base | Representation |
---|---|
bin | 11101001000101100100… |
… | …01101000100000110011 |
3 | 10112201000110100011020112 |
4 | 32210112101220200303 |
5 | 112400223340213412 |
6 | 2043522142531535 |
7 | 132220134646232 |
oct | 16442621504063 |
9 | 3481013304215 |
10 | 1001101101107 |
11 | 356623522508 |
12 | 14202a896bab |
13 | 73532443763 |
14 | 3664c790b19 |
15 | 1b093268722 |
hex | e916468833 |
1001101101107 has 8 divisors (see below), whose sum is σ = 1042899868080. Its totient is φ = 960130032640.
The previous prime is 1001101101101. The next prime is 1001101101127. The reversal of 1001101101107 is 7011011011001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001101101107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001101101091 and 1001101101100.
It is not an unprimeable number, because it can be changed into a prime (1001101101101) 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 7 ways as a sum of consecutive naturals, for example, 206922158 + ... + 206926995.
It is an arithmetic number, because the mean of its divisors is an integer number (130362483510).
Almost surely, 21001101101107 is an apocalyptic number.
1001101101107 is a deficient number, since it is larger than the sum of its proper divisors (41798766973).
1001101101107 is an equidigital number, since it uses as much as digits as its factorization.
1001101101107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413849253.
The product of its (nonzero) digits is 7, while the sum is 14.
Adding to 1001101101107 its reverse (7011011011001), we get a palindrome (8012112112108).
The spelling of 1001101101107 in words is "one trillion, one billion, one hundred one million, one hundred one thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •