Base | Representation |
---|---|
bin | 101100010010… |
… | …000110101101 |
3 | 210211202212012 |
4 | 230102012231 |
5 | 10432432433 |
6 | 1052451005 |
7 | 200446001 |
oct | 54220655 |
9 | 23752765 |
10 | 11608493 |
11 | 66096a6 |
12 | 3a79a65 |
13 | 2535a40 |
14 | 1782701 |
15 | 1044848 |
hex | b121ad |
11608493 has 8 divisors (see below), whose sum is σ = 12527928. Its totient is φ = 10692864.
The previous prime is 11608489. The next prime is 11608511. The reversal of 11608493 is 39480611.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 170569 + 11437924 = 413^2 + 3382^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11608493 - 22 = 11608489 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 (11608403) 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, 11705 + ... + 12657.
It is an arithmetic number, because the mean of its divisors is an integer number (1565991).
Almost surely, 211608493 is an apocalyptic number.
11608493 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11608493 is a deficient number, since it is larger than the sum of its proper divisors (919435).
11608493 is an equidigital number, since it uses as much as digits as its factorization.
11608493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1903.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 11608493 is about 3407.1238603843. The cubic root of 11608493 is about 226.4254717623.
The spelling of 11608493 in words is "eleven million, six hundred eight thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •