Base | Representation |
---|---|
bin | 101100100011… |
… | …110001110100 |
3 | 210222110011100 |
4 | 230203301310 |
5 | 10442242014 |
6 | 1054210100 |
7 | 201200025 |
oct | 54436164 |
9 | 23873140 |
10 | 11680884 |
11 | 6659026 |
12 | 3ab3930 |
13 | 255c987 |
14 | 17a0c4c |
15 | 105b009 |
hex | b23c74 |
11680884 has 18 divisors (see below), whose sum is σ = 29526770. Its totient is φ = 3893616.
The previous prime is 11680883. The next prime is 11680897. The reversal of 11680884 is 48808611.
11680884 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 10381284 + 1299600 = 3222^2 + 1140^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: 324469 = 11680884 / (1 + 1 + 6 + 8 + 0 + 8 + 8 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11680883) 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, 162199 + ... + 162270.
Almost surely, 211680884 is an apocalyptic number.
It is an amenable number.
11680884 is an abundant number, since it is smaller than the sum of its proper divisors (17845886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11680884 is a wasteful number, since it uses less digits than its factorization.
11680884 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324479 (or 324474 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 36.
The square root of 11680884 is about 3417.7308261477. The cubic root of 11680884 is about 226.8951627005.
The spelling of 11680884 in words is "eleven million, six hundred eighty thousand, eight hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •