Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …111011001001011001001 |
3 | 10220021010121222221122011 |
4 | 100001132233121023021 |
5 | 121020023341004321 |
6 | 2201501110055521 |
7 | 142360212002446 |
oct | 20013657311311 |
9 | 3807117887564 |
10 | 1101101109961 |
11 | 394a79964226 |
12 | 15949864a5a1 |
13 | 7caaac57228 |
14 | 3b4178149cd |
15 | 1d9974a5ae1 |
hex | 1005ebd92c9 |
1101101109961 has 2 divisors, whose sum is σ = 1101101109962. Its totient is φ = 1101101109960.
The previous prime is 1101101109947. The next prime is 1101101110051. The reversal of 1101101109961 is 1699011011011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1100904577600 + 196532361 = 1049240^2 + 14019^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101101109961 - 25 = 1101101109929 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101101109061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550550554980 + 550550554981.
It is an arithmetic number, because the mean of its divisors is an integer number (550550554981).
Almost surely, 21101101109961 is an apocalyptic number.
It is an amenable number.
1101101109961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101101109961 is an equidigital number, since it uses as much as digits as its factorization.
1101101109961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 31.
The spelling of 1101101109961 in words is "one trillion, one hundred one billion, one hundred one million, one hundred nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •