Base | Representation |
---|---|
bin | 1100100110001… |
… | …01100000110101 |
3 | 21100211102100021 |
4 | 12103011200311 |
5 | 204022312423 |
6 | 14252445141 |
7 | 2422102633 |
oct | 623054065 |
9 | 240742307 |
10 | 105666613 |
11 | 54711988 |
12 | 2b4797b1 |
13 | 18b78b30 |
14 | 10068353 |
15 | 942395d |
hex | 64c5835 |
105666613 has 6 divisors (see below), whose sum is σ = 113834742. Its totient is φ = 97504200.
The previous prime is 105666601. The next prime is 105666643. The reversal of 105666613 is 316666501.
It can be written as a sum of positive squares in only one way, i.e., 73153809 + 32512804 = 8553^2 + 5702^2 .
It is a de Polignac number, because none of the positive numbers 2k-105666613 is a prime.
It is a super-2 number, since 2×1056666132 = 22330866205783538, 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 (105666643) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 35638 + ... + 38488.
It is an arithmetic number, because the mean of its divisors is an integer number (18972457).
Almost surely, 2105666613 is an apocalyptic number.
105666613 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
105666613 is a deficient number, since it is larger than the sum of its proper divisors (8168129).
105666613 is an frugal number, since it uses more digits than its factorization.
105666613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5715 (or 2864 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 34.
The square root of 105666613 is about 10279.4266863478. The cubic root of 105666613 is about 472.7656660397.
The spelling of 105666613 in words is "one hundred five million, six hundred sixty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.264 sec. • engine limits •