Base | Representation |
---|---|
bin | 110011111010… |
… | …010011010000 |
3 | 221121100212100 |
4 | 303322103100 |
5 | 11440430034 |
6 | 1203400400 |
7 | 223444614 |
oct | 63722320 |
9 | 27540770 |
10 | 13608144 |
11 | 7755000 |
12 | 4683100 |
13 | 2a85c74 |
14 | 1b43344 |
15 | 12dc099 |
hex | cfa4d0 |
13608144 has 120 divisors (see below), whose sum is σ = 42479424. Its totient is φ = 4065600.
The previous prime is 13608139. The next prime is 13608151. The reversal of 13608144 is 44180631.
13608144 = T207 + T208 + ... + T448.
13608144 is a `hidden beast` number, since 13 + 608 + 1 + 44 = 666.
13608144 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a nialpdrome in base 11.
It is a zygodrome in base 11.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 191629 + ... + 191699.
Almost surely, 213608144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13608144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21239712).
13608144 is an abundant number, since it is smaller than the sum of its proper divisors (28871280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13608144 is a wasteful number, since it uses less digits than its factorization.
13608144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118 (or 87 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 13608144 is about 3688.9217936953. The cubic root of 13608144 is about 238.7442745993.
Adding to 13608144 its reverse (44180631), we get a palindrome (57788775).
The spelling of 13608144 in words is "thirteen million, six hundred eight thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •