Base | Representation |
---|---|
bin | 101011110100… |
… | …000001010101 |
3 | 210121111211100 |
4 | 223310001111 |
5 | 10420012034 |
6 | 1050100313 |
7 | 166423515 |
oct | 53640125 |
9 | 23544740 |
10 | 11485269 |
11 | 6535064 |
12 | 3a1a699 |
13 | 24c1923 |
14 | 174d845 |
15 | 101d099 |
hex | af4055 |
11485269 has 12 divisors (see below), whose sum is σ = 16664076. Its totient is φ = 7622592.
The previous prime is 11485267. The next prime is 11485277. The reversal of 11485269 is 96258411.
It can be written as a sum of positive squares in 2 ways, for example, as 8191044 + 3294225 = 2862^2 + 1815^2 .
It is not a de Polignac number, because 11485269 - 21 = 11485267 is a prime.
It is a super-2 number, since 2×114852692 = 263822808004722, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11485261) 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 11 ways as a sum of consecutive naturals, for example, 642 + ... + 4835.
It is an arithmetic number, because the mean of its divisors is an integer number (1388673).
Almost surely, 211485269 is an apocalyptic number.
It is an amenable number.
11485269 is a deficient number, since it is larger than the sum of its proper divisors (5178807).
11485269 is a wasteful number, since it uses less digits than its factorization.
11485269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5716 (or 5713 counting only the distinct ones).
The product of its digits is 17280, while the sum is 36.
The square root of 11485269 is about 3388.9923281117. The cubic root of 11485269 is about 225.6214523323.
It can be divided in two parts, 114852 and 69, that added together give a square (114921 = 3392).
The spelling of 11485269 in words is "eleven million, four hundred eighty-five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •