Base | Representation |
---|---|
bin | 101000100011… |
… | …010110011001 |
3 | 202000002101012 |
4 | 220203112121 |
5 | 10210134203 |
6 | 1015503305 |
7 | 156233603 |
oct | 50432631 |
9 | 22002335 |
10 | 10630553 |
11 | 600098a |
12 | 3687b35 |
13 | 228288b |
14 | 15aa173 |
15 | deebd8 |
hex | a23599 |
10630553 has 4 divisors (see below), whose sum is σ = 10735908. Its totient is φ = 10525200.
The previous prime is 10630549. The next prime is 10630567. The reversal of 10630553 is 35503601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35503601 = 7 ⋅5071943.
It can be written as a sum of positive squares in 2 ways, for example, as 5626384 + 5004169 = 2372^2 + 2237^2 .
It is a cyclic number.
It is not a de Polignac number, because 10630553 - 22 = 10630549 is a prime.
It is a super-2 number, since 2×106305532 = 226017314171618, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10630513) 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, 52526 + ... + 52727.
It is an arithmetic number, because the mean of its divisors is an integer number (2683977).
Almost surely, 210630553 is an apocalyptic number.
It is an amenable number.
10630553 is a deficient number, since it is larger than the sum of its proper divisors (105355).
10630553 is a wasteful number, since it uses less digits than its factorization.
10630553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105354.
The product of its (nonzero) digits is 1350, while the sum is 23.
The square root of 10630553 is about 3260.4528826530. The cubic root of 10630553 is about 219.8797759105.
The spelling of 10630553 in words is "ten million, six hundred thirty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •