Base | Representation |
---|---|
bin | 110011111001… |
… | …011010000000 |
3 | 221121011211122 |
4 | 303321122000 |
5 | 11440320410 |
6 | 1203331412 |
7 | 223431131 |
oct | 63713200 |
9 | 27534748 |
10 | 13604480 |
11 | 775227a |
12 | 4680b68 |
13 | 2a843b6 |
14 | 1b41c88 |
15 | 12dae55 |
hex | cf9680 |
13604480 has 64 divisors (see below), whose sum is σ = 33690600. Its totient is φ = 5246976.
The previous prime is 13604473. The next prime is 13604491. The reversal of 13604480 is 8440631.
It can be written as a sum of positive squares in 4 ways, for example, as 13366336 + 238144 = 3656^2 + 488^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18194 + ... + 18926.
Almost surely, 213604480 is an apocalyptic number.
13604480 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 13604480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16845300).
13604480 is an abundant number, since it is smaller than the sum of its proper divisors (20086120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13604480 is an equidigital number, since it uses as much as digits as its factorization.
13604480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 781 (or 769 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 13604480 is about 3688.4251381857. The cubic root of 13604480 is about 238.7228453350.
The spelling of 13604480 in words is "thirteen million, six hundred four thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •