Base | Representation |
---|---|
bin | 101000010011… |
… | …100111110101 |
3 | 201212211000021 |
4 | 220103213311 |
5 | 10201104013 |
6 | 1014245141 |
7 | 155545024 |
oct | 50234765 |
9 | 21784007 |
10 | 10566133 |
11 | 5a67546 |
12 | 36567b1 |
13 | 225c466 |
14 | 15908bb |
15 | ddaa8d |
hex | a139f5 |
10566133 has 16 divisors (see below), whose sum is σ = 11404800. Its totient is φ = 9771840.
The previous prime is 10566107. The next prime is 10566139. The reversal of 10566133 is 33166501.
10566133 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10566133 is a prime.
It is a super-2 number, since 2×105661332 = 223286333147378, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10566098 and 10566107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10566139) 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 15 ways as a sum of consecutive naturals, for example, 96883 + ... + 96991.
It is an arithmetic number, because the mean of its divisors is an integer number (712800).
Almost surely, 210566133 is an apocalyptic number.
It is an amenable number.
10566133 is a deficient number, since it is larger than the sum of its proper divisors (838667).
10566133 is a wasteful number, since it uses less digits than its factorization.
10566133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252.
The product of its (nonzero) digits is 1620, while the sum is 25.
The square root of 10566133 is about 3250.5588750244. The cubic root of 10566133 is about 219.4347265021.
The spelling of 10566133 in words is "ten million, five hundred sixty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •