Base | Representation |
---|---|
bin | 101011111110… |
… | …010111110100 |
3 | 210200122222200 |
4 | 223332113310 |
5 | 10422341133 |
6 | 1051024500 |
7 | 166661235 |
oct | 53762764 |
9 | 23618880 |
10 | 11527668 |
11 | 65639a9 |
12 | 3a3b130 |
13 | 2508009 |
14 | 176108c |
15 | 102a913 |
hex | afe5f4 |
11527668 has 18 divisors (see below), whose sum is σ = 29139474. Its totient is φ = 3842544.
The previous prime is 11527667. The next prime is 11527673. The reversal of 11527668 is 86672511.
It can be written as a sum of positive squares in only one way, i.e., 6411024 + 5116644 = 2532^2 + 2262^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 320213 = 11527668 / (1 + 1 + 5 + 2 + 7 + 6 + 6 + 8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11527667) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 160071 + ... + 160142.
Almost surely, 211527668 is an apocalyptic number.
11527668 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11527668 is an abundant number, since it is smaller than the sum of its proper divisors (17611806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11527668 is a wasteful number, since it uses less digits than its factorization.
11527668 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320223 (or 320218 counting only the distinct ones).
The product of its digits is 20160, while the sum is 36.
The square root of 11527668 is about 3395.2419648679. The cubic root of 11527668 is about 225.8987459859.
The spelling of 11527668 in words is "eleven million, five hundred twenty-seven thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •