Base | Representation |
---|---|
bin | 101000011101… |
… | …000111111101 |
3 | 201221210101202 |
4 | 220131013331 |
5 | 10203330203 |
6 | 1015145245 |
7 | 156066344 |
oct | 50350775 |
9 | 21853352 |
10 | 10605053 |
11 | 5a93808 |
12 | 3675225 |
13 | 22740a4 |
14 | 15a0b5b |
15 | de7388 |
hex | a1d1fd |
10605053 has 4 divisors (see below), whose sum is σ = 10636860. Its totient is φ = 10573248.
The previous prime is 10605037. The next prime is 10605079. The reversal of 10605053 is 35050601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35050601 = 191 ⋅183511.
It can be written as a sum of positive squares in 2 ways, for example, as 3912484 + 6692569 = 1978^2 + 2587^2 .
It is a cyclic number.
It is not a de Polignac number, because 10605053 - 24 = 10605037 is a prime.
It is a super-2 number, since 2×106050532 = 224934298265618, 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 (10605013) 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, 15398 + ... + 16071.
It is an arithmetic number, because the mean of its divisors is an integer number (2659215).
Almost surely, 210605053 is an apocalyptic number.
It is an amenable number.
10605053 is a deficient number, since it is larger than the sum of its proper divisors (31807).
10605053 is an equidigital number, since it uses as much as digits as its factorization.
10605053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31806.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 10605053 is about 3256.5400350679. The cubic root of 10605053 is about 219.7038232116.
Adding to 10605053 its reverse (35050601), we get a palindrome (45655654).
The spelling of 10605053 in words is "ten million, six hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •