Base | Representation |
---|---|
bin | 1100100110001… |
… | …01011100001001 |
3 | 21100211101221011 |
4 | 12103011130021 |
5 | 204022310223 |
6 | 14252443521 |
7 | 2422102024 |
oct | 623053411 |
9 | 240741834 |
10 | 105666313 |
11 | 54711735 |
12 | 2b4795a1 |
13 | 18b7895c |
14 | 100681bb |
15 | 942380d |
hex | 64c5709 |
105666313 has 4 divisors (see below), whose sum is σ = 105902100. Its totient is φ = 105430528.
The previous prime is 105666311. The next prime is 105666317. The reversal of 105666313 is 313666501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 313666501 = 37 ⋅8477473.
It can be written as a sum of positive squares in 2 ways, for example, as 72454144 + 33212169 = 8512^2 + 5763^2 .
It is a cyclic number.
It is not a de Polignac number, because 105666313 - 21 = 105666311 is a prime.
It is a super-2 number, since 2×1056663132 = 22330739406027938, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105666311) 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, 117220 + ... + 118117.
It is an arithmetic number, because the mean of its divisors is an integer number (26475525).
Almost surely, 2105666313 is an apocalyptic number.
It is an amenable number.
105666313 is a deficient number, since it is larger than the sum of its proper divisors (235787).
105666313 is an equidigital number, since it uses as much as digits as its factorization.
105666313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 235786.
The product of its (nonzero) digits is 9720, while the sum is 31.
The square root of 105666313 is about 10279.4120940840. The cubic root of 105666313 is about 472.7652186267.
The spelling of 105666313 in words is "one hundred five million, six hundred sixty-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •