Base | Representation |
---|---|
bin | 101010010111… |
… | …000010110001 |
3 | 202220011102022 |
4 | 222113002301 |
5 | 10320320213 |
6 | 1034001225 |
7 | 163246304 |
oct | 52270261 |
9 | 22804368 |
10 | 11104433 |
11 | 62a4a1a |
12 | 3876215 |
13 | 23ba492 |
14 | 1690b3b |
15 | e95308 |
hex | a970b1 |
11104433 has 4 divisors (see below), whose sum is σ = 11119860. Its totient is φ = 11089008.
The previous prime is 11104427. The next prime is 11104447. The reversal of 11104433 is 33440111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33440111 = 43 ⋅777677.
It can be written as a sum of positive squares in 2 ways, for example, as 7011904 + 4092529 = 2648^2 + 2023^2 .
It is a cyclic number.
It is not a de Polignac number, because 11104433 - 26 = 11104369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11104333) 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, 6578 + ... + 8091.
It is an arithmetic number, because the mean of its divisors is an integer number (2779965).
Almost surely, 211104433 is an apocalyptic number.
It is an amenable number.
11104433 is a deficient number, since it is larger than the sum of its proper divisors (15427).
11104433 is an equidigital number, since it uses as much as digits as its factorization.
11104433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15426.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 11104433 is about 3332.3314661060. The cubic root of 11104433 is about 223.0996022584.
Adding to 11104433 its reverse (33440111), we get a palindrome (44544544).
The spelling of 11104433 in words is "eleven million, one hundred four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •