Base | Representation |
---|---|
bin | 110100000111… |
… | …000000000000 |
3 | 221201000012212 |
4 | 310013000000 |
5 | 11444111120 |
6 | 1204441252 |
7 | 224052353 |
oct | 64070000 |
9 | 27630185 |
10 | 13660160 |
11 | 7790098 |
12 | 46a9228 |
13 | 2aa3847 |
14 | 1b5829a |
15 | 12ec6c5 |
hex | d07000 |
13660160 has 104 divisors (see below), whose sum is σ = 35385120. Its totient is φ = 5046272.
The previous prime is 13660159. The next prime is 13660193. The reversal of 13660160 is 6106631.
It is a hoax number, since the sum of its digits (23) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 471026 + ... + 471054.
Almost surely, 213660160 is an apocalyptic number.
13660160 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 13660160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17692560).
13660160 is an abundant number, since it is smaller than the sum of its proper divisors (21724960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13660160 is an equidigital number, since it uses as much as digits as its factorization.
13660160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
The square root of 13660160 is about 3695.9653678031. The cubic root of 13660160 is about 239.0480812213.
Adding to 13660160 its reverse (6106631), we get a palindrome (19766791).
The spelling of 13660160 in words is "thirteen million, six hundred sixty thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •