Base | Representation |
---|---|
bin | 101100100000… |
… | …110000111011 |
3 | 210221211020010 |
4 | 230200300323 |
5 | 10441343124 |
6 | 1054033003 |
7 | 201116031 |
oct | 54406073 |
9 | 23854203 |
10 | 11668539 |
11 | 664a823 |
12 | 3aa8763 |
13 | 255717c |
14 | 179a551 |
15 | 1057529 |
hex | b20c3b |
11668539 has 8 divisors (see below), whose sum is σ = 15771472. Its totient is φ = 7672320.
The previous prime is 11668513. The next prime is 11668541. The reversal of 11668539 is 93586611.
11668539 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 not a de Polignac number, because 11668539 - 211 = 11666491 is a prime.
It is a super-3 number, since 3×116685393 (a number of 22 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11668497 and 11668506.
It is not an unprimeable number, because it can be changed into a prime (11668589) 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 7 ways as a sum of consecutive naturals, for example, 26422 + ... + 26859.
It is an arithmetic number, because the mean of its divisors is an integer number (1971434).
Almost surely, 211668539 is an apocalyptic number.
11668539 is a deficient number, since it is larger than the sum of its proper divisors (4102933).
11668539 is an equidigital number, since it uses as much as digits as its factorization.
11668539 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53357.
The product of its digits is 38880, while the sum is 39.
The square root of 11668539 is about 3415.9243258597. The cubic root of 11668539 is about 226.8152027670.
The spelling of 11668539 in words is "eleven million, six hundred sixty-eight thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •