Base | Representation |
---|---|
bin | 110001100111110001… |
… | …0000111111010000101 |
3 | 101012001102101220202002 |
4 | 1203033202013322011 |
5 | 3221214111402401 |
6 | 120541540555045 |
7 | 10461452633651 |
oct | 1431742077205 |
9 | 335042356662 |
10 | 106561044101 |
11 | 41212a276a6 |
12 | 1879b0b2a85 |
13 | a082bb4865 |
14 | 522c595a61 |
15 | 2b8a247a6b |
hex | 18cf887e85 |
106561044101 has 4 divisors (see below), whose sum is σ = 106570081152. Its totient is φ = 106552007052.
The previous prime is 106561044077. The next prime is 106561044113. The reversal of 106561044101 is 101440165601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106561044101 - 222 = 106556849797 is a prime.
It is a super-2 number, since 2×1065610441012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106561044151) 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 in 3 ways as a sum of consecutive naturals, for example, 4500815 + ... + 4524428.
It is an arithmetic number, because the mean of its divisors is an integer number (26642520288).
Almost surely, 2106561044101 is an apocalyptic number.
It is an amenable number.
106561044101 is a deficient number, since it is larger than the sum of its proper divisors (9037051).
106561044101 is an equidigital number, since it uses as much as digits as its factorization.
106561044101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9037050.
The product of its (nonzero) digits is 2880, while the sum is 29.
The spelling of 106561044101 in words is "one hundred six billion, five hundred sixty-one million, forty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •