Base | Representation |
---|---|
bin | 110011111010… |
… | …101110010000 |
3 | 221121110020100 |
4 | 303322232100 |
5 | 11441003442 |
6 | 1203412400 |
7 | 223452633 |
oct | 63725620 |
9 | 27543210 |
10 | 13609872 |
11 | 7756331 |
12 | 4684100 |
13 | 2a869a3 |
14 | 1b43c1a |
15 | 12dc84c |
hex | cfab90 |
13609872 has 30 divisors (see below), whose sum is σ = 38089142. Its totient is φ = 4536576.
The previous prime is 13609853. The next prime is 13609873. The reversal of 13609872 is 27890631.
It can be written as a sum of positive squares in only one way, i.e., 13220496 + 389376 = 3636^2 + 624^2 .
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (13609873) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 47113 + ... + 47400.
Almost surely, 213609872 is an apocalyptic number.
13609872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13609872 is an abundant number, since it is smaller than the sum of its proper divisors (24479270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13609872 is a wasteful number, since it uses less digits than its factorization.
13609872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94527 (or 94518 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 13609872 is about 3689.1560010387. The cubic root of 13609872 is about 238.7543796424.
The spelling of 13609872 in words is "thirteen million, six hundred nine thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •