Base | Representation |
---|---|
bin | 101000101010… |
… | …111011011001 |
3 | 202001122221211 |
4 | 220222323121 |
5 | 10212132333 |
6 | 1020303121 |
7 | 156423235 |
oct | 50527331 |
9 | 22048854 |
10 | 10661593 |
11 | 6022238 |
12 | 36a1aa1 |
13 | 2293a47 |
14 | 15b75c5 |
15 | e08ecd |
hex | a2aed9 |
10661593 has 4 divisors (see below), whose sum is σ = 10672948. Its totient is φ = 10650240.
The previous prime is 10661591. The next prime is 10661597. The reversal of 10661593 is 39516601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8596624 + 2064969 = 2932^2 + 1437^2 .
It is a cyclic number.
It is not a de Polignac number, because 10661593 - 21 = 10661591 is a prime.
It is a super-2 number, since 2×106615932 = 227339130595298, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10661591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4128 + ... + 6193.
It is an arithmetic number, because the mean of its divisors is an integer number (2668237).
Almost surely, 210661593 is an apocalyptic number.
It is an amenable number.
10661593 is a deficient number, since it is larger than the sum of its proper divisors (11355).
10661593 is a wasteful number, since it uses less digits than its factorization.
10661593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11354.
The product of its (nonzero) digits is 4860, while the sum is 31.
The square root of 10661593 is about 3265.2094879196. The cubic root of 10661593 is about 220.0935758948.
The spelling of 10661593 in words is "ten million, six hundred sixty-one thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •