Base | Representation |
---|---|
bin | 101010000111… |
… | …100100100111 |
3 | 202202221111021 |
4 | 222013210213 |
5 | 10311303223 |
6 | 1032352011 |
7 | 162563455 |
oct | 52074447 |
9 | 22687437 |
10 | 11041063 |
11 | 6261350 |
12 | 3845607 |
13 | 2397697 |
14 | 16759d5 |
15 | e8165d |
hex | a87927 |
11041063 has 4 divisors (see below), whose sum is σ = 12044808. Its totient is φ = 10037320.
The previous prime is 11041039. The next prime is 11041087. The reversal of 11041063 is 36014011.
11041063 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 36014011 = 11 ⋅3274001.
It is an interprime number because it is at equal distance from previous prime (11041039) and next prime (11041087).
It is a cyclic number.
It is not a de Polignac number, because 11041063 - 217 = 10909991 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 (11041463) 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, 501856 + ... + 501877.
It is an arithmetic number, because the mean of its divisors is an integer number (3011202).
Almost surely, 211041063 is an apocalyptic number.
11041063 is a deficient number, since it is larger than the sum of its proper divisors (1003745).
11041063 is a wasteful number, since it uses less digits than its factorization.
11041063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1003744.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 11041063 is about 3322.8095040192. The cubic root of 11041063 is about 222.6744026719.
Adding to 11041063 its reverse (36014011), we get a palindrome (47055074).
The spelling of 11041063 in words is "eleven million, forty-one thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •