Base | Representation |
---|---|
bin | 100110010110… |
… | …100000011101 |
3 | 200220210000211 |
4 | 212112200131 |
5 | 10033204121 |
6 | 555252421 |
7 | 151311652 |
oct | 46264035 |
9 | 20823024 |
10 | 10053661 |
11 | 5747512 |
12 | 344a111 |
13 | 2110117 |
14 | 1499c29 |
15 | d38ce1 |
hex | 99681d |
10053661 has 4 divisors (see below), whose sum is σ = 10071900. Its totient is φ = 10035424.
The previous prime is 10053653. The next prime is 10053689. The reversal of 10053661 is 16635001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16635001 = 449 ⋅37049.
It can be written as a sum of positive squares in 2 ways, for example, as 1822500 + 8231161 = 1350^2 + 2869^2 .
It is a cyclic number.
It is not a de Polignac number, because 10053661 - 23 = 10053653 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10053601) 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, 8266 + ... + 9403.
It is an arithmetic number, because the mean of its divisors is an integer number (2517975).
Almost surely, 210053661 is an apocalyptic number.
It is an amenable number.
10053661 is a deficient number, since it is larger than the sum of its proper divisors (18239).
10053661 is an equidigital number, since it uses as much as digits as its factorization.
10053661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18238.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 10053661 is about 3170.7508574469. The cubic root of 10053661 is about 215.8281454837.
Adding to 10053661 its reverse (16635001), we get a palindrome (26688662).
The spelling of 10053661 in words is "ten million, fifty-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •