Base | Representation |
---|---|
bin | 110100001001… |
… | …000100100101 |
3 | 221201102212010 |
4 | 310021010211 |
5 | 11444344040 |
6 | 1204544433 |
7 | 224116164 |
oct | 64110445 |
9 | 27642763 |
10 | 13668645 |
11 | 7796501 |
12 | 46b2119 |
13 | 2aa7673 |
14 | 1b5b3db |
15 | 12eee80 |
hex | d09125 |
13668645 has 16 divisors (see below), whose sum is σ = 21943872. Its totient is φ = 7265280.
The previous prime is 13668637. The next prime is 13668653. The reversal of 13668645 is 54686631.
It is an interprime number because it is at equal distance from previous prime (13668637) and next prime (13668653).
It is not a de Polignac number, because 13668645 - 23 = 13668637 is a prime.
It is a super-2 number, since 2×136686452 = 373663712272050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3589 + ... + 6341.
It is an arithmetic number, because the mean of its divisors is an integer number (1371492).
Almost surely, 213668645 is an apocalyptic number.
13668645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13668645 is a deficient number, since it is larger than the sum of its proper divisors (8275227).
13668645 is a wasteful number, since it uses less digits than its factorization.
13668645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3092.
The product of its digits is 103680, while the sum is 39.
The square root of 13668645 is about 3697.1130629181. The cubic root of 13668645 is about 239.0975658332.
Subtracting from 13668645 its sum of digits (39), we obtain a triangular number (13668606 = T5228).
It can be divided in two parts, 1366 and 8645, that added together give a triangular number (10011 = T141).
The spelling of 13668645 in words is "thirteen million, six hundred sixty-eight thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •