Base | Representation |
---|---|
bin | 110100001001… |
… | …111010110100 |
3 | 221201121121200 |
4 | 310021322310 |
5 | 12000001431 |
6 | 1205012500 |
7 | 224132253 |
oct | 64117264 |
9 | 27647550 |
10 | 13672116 |
11 | 7799077 |
12 | 46b4130 |
13 | 2aa9113 |
14 | 1b5c79a |
15 | 1300ee6 |
hex | d09eb4 |
13672116 has 36 divisors (see below), whose sum is σ = 35677824. Its totient is φ = 4410000.
The previous prime is 13672111. The next prime is 13672121. The reversal of 13672116 is 61127631.
13672116 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13672111) and next prime (13672121).
It is a tau number, because it is divible by the number of its divisors (36).
It is a self number, because there is not a number n which added to its sum of digits gives 13672116.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13672111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5010 + ... + 7241.
Almost surely, 213672116 is an apocalyptic number.
It is an amenable number.
13672116 is an abundant number, since it is smaller than the sum of its proper divisors (22005708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13672116 is a wasteful number, since it uses less digits than its factorization.
13672116 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12292 (or 12287 counting only the distinct ones).
The product of its digits is 1512, while the sum is 27.
The square root of 13672116 is about 3697.5824534417. The cubic root of 13672116 is about 239.1178028407.
Adding to 13672116 its reverse (61127631), we get a palindrome (74799747).
The spelling of 13672116 in words is "thirteen million, six hundred seventy-two thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •