Base | Representation |
---|---|
bin | 101000101011… |
… | …010010000001 |
3 | 202001201221110 |
4 | 220223102001 |
5 | 10212204131 |
6 | 1020313533 |
7 | 156430404 |
oct | 50532201 |
9 | 22051843 |
10 | 10663041 |
11 | 6023334 |
12 | 36a28a9 |
13 | 22945bc |
14 | 15b7d3b |
15 | e09646 |
hex | a2b481 |
10663041 has 8 divisors (see below), whose sum is σ = 14247360. Its totient is φ = 7093712.
The previous prime is 10663033. The next prime is 10663043. The reversal of 10663041 is 14036601.
10663041 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10663041 - 23 = 10663033 is a prime.
It is a super-2 number, since 2×106630412 = 227400886735362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10662999 and 10663017.
It is not an unprimeable number, because it can be changed into a prime (10663043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1965 + ... + 5018.
It is an arithmetic number, because the mean of its divisors is an integer number (1780920).
Almost surely, 210663041 is an apocalyptic number.
It is an amenable number.
10663041 is a deficient number, since it is larger than the sum of its proper divisors (3584319).
10663041 is an equidigital number, since it uses as much as digits as its factorization.
10663041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7495.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 10663041 is about 3265.4312119535. The cubic root of 10663041 is about 220.1035394175.
Adding to 10663041 its reverse (14036601), we get a palindrome (24699642).
The spelling of 10663041 in words is "ten million, six hundred sixty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •