Base | Representation |
---|---|
bin | 110011010000… |
… | …100000100000 |
3 | 221021200001012 |
4 | 303100200200 |
5 | 11414440320 |
6 | 1200000052 |
7 | 222132545 |
oct | 63204040 |
9 | 27250035 |
10 | 13436960 |
11 | 7648429 |
12 | 4600028 |
13 | 2a26084 |
14 | 1adabcc |
15 | 12a64c5 |
hex | cd0820 |
13436960 has 48 divisors (see below), whose sum is σ = 32028696. Its totient is φ = 5326848.
The previous prime is 13436959. The next prime is 13436989. The reversal of 13436960 is 6963431.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 6739216 + 6697744 = 2596^2 + 2588^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 21614 + ... + 22226.
Almost surely, 213436960 is an apocalyptic number.
13436960 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 13436960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16014348).
13436960 is an abundant number, since it is smaller than the sum of its proper divisors (18591736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13436960 is a wasteful number, since it uses less digits than its factorization.
13436960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765 (or 757 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 32.
The square root of 13436960 is about 3665.6459185251. The cubic root of 13436960 is about 237.7389506450.
The spelling of 13436960 in words is "thirteen million, four hundred thirty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •