Base | Representation |
---|---|
bin | 110100001111… |
… | …111010000001 |
3 | 221202212021000 |
4 | 310033322001 |
5 | 12001243031 |
6 | 1205322213 |
7 | 224263620 |
oct | 64177201 |
9 | 27685230 |
10 | 13696641 |
11 | 7805542 |
12 | 4706369 |
13 | 2ab732a |
14 | 1b676b7 |
15 | 13083e6 |
hex | d0fe81 |
13696641 has 16 divisors (see below), whose sum is σ = 23190400. Its totient is φ = 7826544.
The previous prime is 13696633. The next prime is 13696649. The reversal of 13696641 is 14669631.
13696641 is a `hidden beast` number, since 1 + 3 + 6 + 9 + 6 + 641 = 666.
13696641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13696633) and next prime (13696649).
It is not a de Polignac number, because 13696641 - 23 = 13696633 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13696596 and 13696605.
It is not an unprimeable number, because it can be changed into a prime (13696649) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36046 + ... + 36423.
It is an arithmetic number, because the mean of its divisors is an integer number (1449400).
Almost surely, 213696641 is an apocalyptic number.
It is an amenable number.
13696641 is a deficient number, since it is larger than the sum of its proper divisors (9493759).
13696641 is an equidigital number, since it uses as much as digits as its factorization.
13696641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72485 (or 72479 counting only the distinct ones).
The product of its digits is 23328, while the sum is 36.
The square root of 13696641 is about 3700.8973236230. The cubic root of 13696641 is about 239.2606936976.
The spelling of 13696641 in words is "thirteen million, six hundred ninety-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •