Base | Representation |
---|---|
bin | 101100010001… |
… | …000110010100 |
3 | 210211120012120 |
4 | 230101012110 |
5 | 10432314442 |
6 | 1052415540 |
7 | 200430663 |
oct | 54210624 |
9 | 23746176 |
10 | 11604372 |
11 | 660659a |
12 | 3a775b0 |
13 | 2533bc0 |
14 | 1780dda |
15 | 10434ec |
hex | b11194 |
11604372 has 48 divisors (see below), whose sum is σ = 29588160. Its totient is φ = 3518208.
The previous prime is 11604317. The next prime is 11604407. The reversal of 11604372 is 27340611.
It is a super-2 number, since 2×116043722 = 269322899028768, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10879 + ... + 11897.
It is an arithmetic number, because the mean of its divisors is an integer number (616420).
Almost surely, 211604372 is an apocalyptic number.
11604372 is a gapful number since it is divisible by the number (12) 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 11604372, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14794080).
11604372 is an abundant number, since it is smaller than the sum of its proper divisors (17983788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11604372 is a wasteful number, since it uses less digits than its factorization.
11604372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112 (or 1110 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 24.
The square root of 11604372 is about 3406.5190444206. The cubic root of 11604372 is about 226.3986750080.
Adding to 11604372 its reverse (27340611), we get a palindrome (38944983).
The spelling of 11604372 in words is "eleven million, six hundred four thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •