Base | Representation |
---|---|
bin | 1100100101101… |
… | …11001000111101 |
3 | 21100201102120211 |
4 | 12102313020331 |
5 | 204013421431 |
6 | 14251312421 |
7 | 2421436201 |
oct | 622671075 |
9 | 240642524 |
10 | 105607741 |
11 | 54681728 |
12 | 2b44b711 |
13 | 18b580b5 |
14 | 10050b01 |
15 | 94112b1 |
hex | 64b723d |
105607741 has 4 divisors (see below), whose sum is σ = 105629500. Its totient is φ = 105585984.
The previous prime is 105607729. The next prime is 105607751. The reversal of 105607741 is 147706501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 147706501 = 1009 ⋅146389.
It can be written as a sum of positive squares in 2 ways, for example, as 83083225 + 22524516 = 9115^2 + 4746^2 .
It is a cyclic number.
It is not a de Polignac number, because 105607741 - 217 = 105476669 is a prime.
It is a super-2 number, since 2×1056077412 = 22305989918246162, which 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 (105607751) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85 + ... + 14533.
It is an arithmetic number, because the mean of its divisors is an integer number (26407375).
Almost surely, 2105607741 is an apocalyptic number.
It is an amenable number.
105607741 is a deficient number, since it is larger than the sum of its proper divisors (21759).
105607741 is an equidigital number, since it uses as much as digits as its factorization.
105607741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21758.
The product of its (nonzero) digits is 5880, while the sum is 31.
The square root of 105607741 is about 10276.5627035502. The cubic root of 105607741 is about 472.6778494939.
The spelling of 105607741 in words is "one hundred five million, six hundred seven thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •