Base | Representation |
---|---|
bin | 101101000001… |
… | …110110110101 |
3 | 211012201011100 |
4 | 231001312311 |
5 | 11010212320 |
6 | 1101000313 |
7 | 202222146 |
oct | 55016665 |
9 | 24181140 |
10 | 11804085 |
11 | 6732647 |
12 | 3b53099 |
13 | 25a3a87 |
14 | 17d3acd |
15 | 1082790 |
hex | b41db5 |
11804085 has 12 divisors (see below), whose sum is σ = 20460492. Its totient is φ = 6295488.
The previous prime is 11804081. The next prime is 11804113. The reversal of 11804085 is 58040811.
It can be written as a sum of positive squares in 2 ways, for example, as 9199089 + 2604996 = 3033^2 + 1614^2 .
It is not a de Polignac number, because 11804085 - 22 = 11804081 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11804081) 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 11 ways as a sum of consecutive naturals, for example, 131112 + ... + 131201.
It is an arithmetic number, because the mean of its divisors is an integer number (1705041).
Almost surely, 211804085 is an apocalyptic number.
11804085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11804085 is a deficient number, since it is larger than the sum of its proper divisors (8656407).
11804085 is a wasteful number, since it uses less digits than its factorization.
11804085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262324 (or 262321 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 27.
The square root of 11804085 is about 3435.7073507504. The cubic root of 11804085 is about 227.6900798401.
Adding to 11804085 its reverse (58040811), we get a palindrome (69844896).
The spelling of 11804085 in words is "eleven million, eight hundred four thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •