Base | Representation |
---|---|
bin | 110100000111… |
… | …001101000000 |
3 | 221201001100200 |
4 | 310013031000 |
5 | 11444122432 |
6 | 1204445200 |
7 | 224054652 |
oct | 64071500 |
9 | 27631320 |
10 | 13660992 |
11 | 7790784 |
12 | 46a9800 |
13 | 2aa4037 |
14 | 1b586d2 |
15 | 12eca7c |
hex | d07340 |
13660992 has 84 divisors (see below), whose sum is σ = 40277796. Its totient is φ = 4423680.
The previous prime is 13660991. The next prime is 13661003. The reversal of 13660992 is 29906631.
It can be written as a sum of positive squares in 2 ways, for example, as 12278016 + 1382976 = 3504^2 + 1176^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13660991) 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, 20992 + ... + 21632.
Almost surely, 213660992 is an apocalyptic number.
13660992 is a gapful number since it is divisible by the number (12) 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 13660992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20138898).
13660992 is an abundant number, since it is smaller than the sum of its proper divisors (26616804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13660992 is a wasteful number, since it uses less digits than its factorization.
13660992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696 (or 683 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 36.
The square root of 13660992 is about 3696.0779212565. The cubic root of 13660992 is about 239.0529343603.
The spelling of 13660992 in words is "thirteen million, six hundred sixty thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •