Base | Representation |
---|---|
bin | 110100000000… |
… | …010111000000 |
3 | 221122121220110 |
4 | 310000113000 |
5 | 11442223320 |
6 | 1204111320 |
7 | 223610145 |
oct | 64002700 |
9 | 27577813 |
10 | 13632960 |
11 | 7771710 |
12 | 4695540 |
13 | 2a94353 |
14 | 1b4c3cc |
15 | 12e45e0 |
hex | d005c0 |
13632960 has 112 divisors (see below), whose sum is σ = 47256192. Its totient is φ = 3302400.
The previous prime is 13632947. The next prime is 13632967. The reversal of 13632960 is 6923631.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13632967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9915 + ... + 11205.
Almost surely, 213632960 is an apocalyptic number.
13632960 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 13632960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23628096).
13632960 is an abundant number, since it is smaller than the sum of its proper divisors (33623232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13632960 is a wasteful number, since it uses less digits than its factorization.
13632960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1322 (or 1312 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 30.
The square root of 13632960 is about 3692.2838460768. The cubic root of 13632960 is about 238.8893122601.
The spelling of 13632960 in words is "thirteen million, six hundred thirty-two thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •