Base | Representation |
---|---|
bin | 101101101000… |
… | …000110100000 |
3 | 211111200001020 |
4 | 231220012200 |
5 | 11030220421 |
6 | 1104205440 |
7 | 203443644 |
oct | 55500640 |
9 | 24450036 |
10 | 11960736 |
11 | 682a307 |
12 | 4009880 |
13 | 262a178 |
14 | 1834c24 |
15 | 10b3dc6 |
hex | b681a0 |
11960736 has 48 divisors (see below), whose sum is σ = 32768064. Its totient is φ = 3812864.
The previous prime is 11960717. The next prime is 11960771. The reversal of 11960736 is 63706911.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 11960697 and 11960706.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 501 + ... + 4916.
It is an arithmetic number, because the mean of its divisors is an integer number (682668).
Almost surely, 211960736 is an apocalyptic number.
11960736 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11960736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16384032).
11960736 is an abundant number, since it is smaller than the sum of its proper divisors (20807328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11960736 is a wasteful number, since it uses less digits than its factorization.
11960736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5453 (or 5445 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 33.
The square root of 11960736 is about 3458.4297014686. The cubic root of 11960736 is about 228.6928753413.
The spelling of 11960736 in words is "eleven million, nine hundred sixty thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •