Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …1000010000001101000101 |
3 | 1102221200210102021022001022 |
4 | 2200011211120100031011 |
5 | 2420220234144223301 |
6 | 35221501403440525 |
7 | 2213542545661331 |
oct | 240054530201505 |
9 | 42850712238038 |
10 | 11001112101701 |
11 | 35615aaa8a427 |
12 | 129810a226145 |
13 | 61a5289510b7 |
14 | 2a06571447c1 |
15 | 14126e130d1b |
hex | a0165610345 |
11001112101701 has 2 divisors, whose sum is σ = 11001112101702. Its totient is φ = 11001112101700.
The previous prime is 11001112101671. The next prime is 11001112101779. The reversal of 11001112101701 is 10710121110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8002929813025 + 2998182288676 = 2828945^2 + 1731526^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001112101701 - 214 = 11001112085317 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11001112101701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001112301701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500556050850 + 5500556050851.
It is an arithmetic number, because the mean of its divisors is an integer number (5500556050851).
Almost surely, 211001112101701 is an apocalyptic number.
It is an amenable number.
11001112101701 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001112101701 is an equidigital number, since it uses as much as digits as its factorization.
11001112101701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 17.
Adding to 11001112101701 its reverse (10710121110011), we get a palindrome (21711233211712).
The spelling of 11001112101701 in words is "eleven trillion, one billion, one hundred twelve million, one hundred one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •