Base | Representation |
---|---|
bin | 1010000110001110000011… |
… | …1001011110010110011001 |
3 | 1110022100010021200002120202 |
4 | 2201203200321132112121 |
5 | 2423343312433441034 |
6 | 35340101325431545 |
7 | 2224043063356115 |
oct | 241434071362631 |
9 | 43270107602522 |
10 | 11101968655769 |
11 | 35a0355973252 |
12 | 12b3776a0b5b5 |
13 | 626baca55064 |
14 | 2a54a3c52745 |
15 | 143bc366447e |
hex | a18e0e5e599 |
11101968655769 has 2 divisors, whose sum is σ = 11101968655770. Its totient is φ = 11101968655768.
The previous prime is 11101968655741. The next prime is 11101968655807. The reversal of 11101968655769 is 96755686910111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6199676707225 + 4902291948544 = 2489915^2 + 2214112^2 .
It is an emirp because it is prime and its reverse (96755686910111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101968655769 is a prime.
It is a super-2 number, since 2×111019686557692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11101968655969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550984327884 + 5550984327885.
It is an arithmetic number, because the mean of its divisors is an integer number (5550984327885).
Almost surely, 211101968655769 is an apocalyptic number.
It is an amenable number.
11101968655769 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101968655769 is an equidigital number, since it uses as much as digits as its factorization.
11101968655769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24494400, while the sum is 65.
The spelling of 11101968655769 in words is "eleven trillion, one hundred one billion, nine hundred sixty-eight million, six hundred fifty-five thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •