Base | Representation |
---|---|
bin | 110100010010… |
… | …011100110101 |
3 | 221210101112221 |
4 | 310102130311 |
5 | 12002111221 |
6 | 1205442341 |
7 | 224336164 |
oct | 64223465 |
9 | 27711487 |
10 | 13707061 |
11 | 7812355 |
12 | 47103b1 |
13 | 2abbcb4 |
14 | 1b6b3db |
15 | 130b541 |
hex | d12735 |
13707061 has 4 divisors (see below), whose sum is σ = 13911712. Its totient is φ = 13502412.
The previous prime is 13707017. The next prime is 13707073. The reversal of 13707061 is 16070731.
13707061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16070731 = 73 ⋅220147.
It is a cyclic number.
It is not a de Polignac number, because 13707061 - 27 = 13706933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13707091) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 102225 + ... + 102358.
It is an arithmetic number, because the mean of its divisors is an integer number (3477928).
Almost surely, 213707061 is an apocalyptic number.
It is an amenable number.
13707061 is a deficient number, since it is larger than the sum of its proper divisors (204651).
13707061 is an equidigital number, since it uses as much as digits as its factorization.
13707061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204650.
The product of its (nonzero) digits is 882, while the sum is 25.
The square root of 13707061 is about 3702.3048226747. The cubic root of 13707061 is about 239.3213524745.
Adding to 13707061 its reverse (16070731), we get a palindrome (29777792).
The spelling of 13707061 in words is "thirteen million, seven hundred seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •