Base | Representation |
---|---|
bin | 101000011010… |
… | …001100011101 |
3 | 201221011221022 |
4 | 220122030131 |
5 | 10202434203 |
6 | 1015013525 |
7 | 156016352 |
oct | 50321435 |
9 | 21834838 |
10 | 10593053 |
11 | 5a85799 |
12 | 366a2a5 |
13 | 226b7a3 |
14 | 159a629 |
15 | de3a38 |
hex | a1a31d |
10593053 has 4 divisors (see below), whose sum is σ = 10674048. Its totient is φ = 10512060.
The previous prime is 10593049. The next prime is 10593059. The reversal of 10593053 is 35039501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 35039501 = 7 ⋅5005643.
It is a cyclic number.
It is not a de Polignac number, because 10593053 - 22 = 10593049 is a prime.
It is a super-2 number, since 2×105930532 = 224425543721618, 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 (10593059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40301 + ... + 40562.
It is an arithmetic number, because the mean of its divisors is an integer number (2668512).
Almost surely, 210593053 is an apocalyptic number.
It is an amenable number.
10593053 is a deficient number, since it is larger than the sum of its proper divisors (80995).
10593053 is an equidigital number, since it uses as much as digits as its factorization.
10593053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80994.
The product of its (nonzero) digits is 2025, while the sum is 26.
The square root of 10593053 is about 3254.6970673167. The cubic root of 10593053 is about 219.6209243358.
The spelling of 10593053 in words is "ten million, five hundred ninety-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •