Base | Representation |
---|---|
bin | 101101001101… |
… | …001111110100 |
3 | 211022002011022 |
4 | 231031033310 |
5 | 11013210430 |
6 | 1102000312 |
7 | 202505156 |
oct | 55151764 |
9 | 24262138 |
10 | 11850740 |
11 | 6764700 |
12 | 3b76098 |
13 | 25bc095 |
14 | 1806ad6 |
15 | 10914e5 |
hex | b4d3f4 |
11850740 has 72 divisors (see below), whose sum is σ = 28153440. Its totient is φ = 4185280.
The previous prime is 11850739. The next prime is 11850749. The reversal of 11850740 is 4705811.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11850749) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 142739 + ... + 142821.
It is an arithmetic number, because the mean of its divisors is an integer number (391020).
Almost surely, 211850740 is an apocalyptic number.
11850740 is a gapful number since it is divisible by the number (10) 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 11850740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14076720).
11850740 is an abundant number, since it is smaller than the sum of its proper divisors (16302700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11850740 is a wasteful number, since it uses less digits than its factorization.
11850740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173 (or 160 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 26.
The square root of 11850740 is about 3442.4903776191. The cubic root of 11850740 is about 227.9896630176.
Subtracting from 11850740 its reverse (4705811), we obtain a square (7144929 = 26732).
The spelling of 11850740 in words is "eleven million, eight hundred fifty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •