Base | Representation |
---|---|
bin | 101011001000… |
… | …010111111001 |
3 | 210021102120212 |
4 | 223020113321 |
5 | 10343301424 |
6 | 1042200505 |
7 | 165050345 |
oct | 53102771 |
9 | 23242525 |
10 | 11306489 |
11 | 6422807 |
12 | 3953135 |
13 | 245b43c |
14 | 1704625 |
15 | ed510e |
hex | ac85f9 |
11306489 has 4 divisors (see below), whose sum is σ = 11315556. Its totient is φ = 11297424.
The previous prime is 11306483. The next prime is 11306507. The reversal of 11306489 is 98460311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 10837264 + 469225 = 3292^2 + 685^2 .
It is a cyclic number.
It is not a de Polignac number, because 11306489 - 216 = 11240953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11306483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2294 + ... + 5279.
It is an arithmetic number, because the mean of its divisors is an integer number (2828889).
Almost surely, 211306489 is an apocalyptic number.
It is an amenable number.
11306489 is a deficient number, since it is larger than the sum of its proper divisors (9067).
11306489 is an equidigital number, since it uses as much as digits as its factorization.
11306489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9066.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 11306489 is about 3362.5123048102. The cubic root of 11306489 is about 224.4446485001. Note that the first 3 decimals are identical.
The spelling of 11306489 in words is "eleven million, three hundred six thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •