Base | Representation |
---|---|
bin | 110100001101… |
… | …000100100111 |
3 | 221202021100000 |
4 | 310031010213 |
5 | 12000410111 |
6 | 1205152343 |
7 | 224215023 |
oct | 64150447 |
9 | 27667300 |
10 | 13685031 |
11 | 77a7848 |
12 | 46bb6b3 |
13 | 2ab1c69 |
14 | 1b63383 |
15 | 1304c56 |
hex | d0d127 |
13685031 has 24 divisors (see below), whose sum is σ = 20675200. Its totient is φ = 9045432.
The previous prime is 13685029. The next prime is 13685033. The reversal of 13685031 is 13058631.
It is an interprime number because it is at equal distance from previous prime (13685029) and next prime (13685033).
It is not a de Polignac number, because 13685031 - 21 = 13685029 is a prime.
It is a super-3 number, since 3×136850313 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13684986 and 13685004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13685033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48216 + ... + 48498.
Almost surely, 213685031 is an apocalyptic number.
13685031 is a deficient number, since it is larger than the sum of its proper divisors (6990169).
13685031 is an equidigital number, since it uses as much as digits as its factorization.
13685031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497 (or 485 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 13685031 is about 3699.3284525708. The cubic root of 13685031 is about 239.1930712321.
The spelling of 13685031 in words is "thirteen million, six hundred eighty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •