Base | Representation |
---|---|
bin | 110011001000… |
… | …111111010000 |
3 | 221020002210110 |
4 | 303020333100 |
5 | 11412444120 |
6 | 1155201320 |
7 | 221644005 |
oct | 63107720 |
9 | 27202713 |
10 | 13406160 |
11 | 7627279 |
12 | 45a6240 |
13 | 2a15051 |
14 | 1acd8ac |
15 | 129c2e0 |
hex | cc8fd0 |
13406160 has 80 divisors (see below), whose sum is σ = 42122304. Its totient is φ = 3526656.
The previous prime is 13406131. The next prime is 13406179. The reversal of 13406160 is 6160431.
13406160 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
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, 19584 + ... + 20256.
Almost surely, 213406160 is an apocalyptic number.
13406160 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 13406160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21061152).
13406160 is an abundant number, since it is smaller than the sum of its proper divisors (28716144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13406160 is a wasteful number, since it uses less digits than its factorization.
13406160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 772 (or 766 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 13406160 is about 3661.4423387512. The cubic root of 13406160 is about 237.5571644485.
Adding to 13406160 its reverse (6160431), we get a palindrome (19566591).
The spelling of 13406160 in words is "thirteen million, four hundred six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •