Base | Representation |
---|---|
bin | 101010000011… |
… | …010111100001 |
3 | 202202001212102 |
4 | 222003113201 |
5 | 10310230331 |
6 | 1032140145 |
7 | 162462323 |
oct | 52032741 |
9 | 22661772 |
10 | 11023841 |
11 | 624a414 |
12 | 3837655 |
13 | 238c8aa |
14 | 166d613 |
15 | e7b4cb |
hex | a835e1 |
11023841 has 4 divisors (see below), whose sum is σ = 11231892. Its totient is φ = 10815792.
The previous prime is 11023823. The next prime is 11023861. The reversal of 11023841 is 14832011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14832011 = 1931 ⋅7681.
It can be written as a sum of positive squares in 2 ways, for example, as 4393216 + 6630625 = 2096^2 + 2575^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11023841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11023861) 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, 103946 + ... + 104051.
It is an arithmetic number, because the mean of its divisors is an integer number (2807973).
Almost surely, 211023841 is an apocalyptic number.
It is an amenable number.
11023841 is a deficient number, since it is larger than the sum of its proper divisors (208051).
11023841 is an equidigital number, since it uses as much as digits as its factorization.
11023841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208050.
The product of its (nonzero) digits is 192, while the sum is 20.
The square root of 11023841 is about 3320.2170109799. The cubic root of 11023841 is about 222.5585655705.
Adding to 11023841 its reverse (14832011), we get a palindrome (25855852).
The spelling of 11023841 in words is "eleven million, twenty-three thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •