# 13709 (number)

13,709 (thirteen thousand seven hundred nine) is an odd five-digits prime number following 13708 and preceding 13710. In scientific notation, it is written as 1.3709 × 104. The sum of its digits is 20. It has a total of 1 prime factor and 2 positive divisors. There are 13,708 positive integers (up to 13709) that are relatively prime to 13709.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 5
• Sum of Digits 20
• Digital Root 2

## Name

Short name 13 thousand 709 thirteen thousand seven hundred nine

## Notation

Scientific notation 1.3709 × 104 13.709 × 103

## Prime Factorization of 13709

Prime Factorization 13709

Prime number
Distinct Factors Total Factors Radical ω(n) 1 Total number of distinct prime factors Ω(n) 1 Total number of prime factors rad(n) 13709 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) -1 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 9.52581 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 13,709 is 13709. Since it has a total of 1 prime factor, 13,709 is a prime number.

## Divisors of 13709

2 divisors

 Even divisors 0 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 2 Total number of the positive divisors of n σ(n) 13710 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 6855 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 117.085 Returns the nth root of the product of n divisors H(n) 1.99985 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 13,709 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 13,709) is 13,710, the average is 6,855.

## Other Arithmetic Functions (n = 13709)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 13708 Total number of positive integers not greater than n that are coprime to n λ(n) 13708 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1623 Total number of primes less than or equal to n r2(n) 8 The number of ways n can be represented as the sum of 2 squares

There are 13,708 positive integers (less than 13,709) that are coprime with 13,709. And there are approximately 1,623 prime numbers less than or equal to 13,709.

## Divisibility of 13709

 m n mod m 2 3 4 5 6 7 8 9 1 2 1 4 5 3 5 2

13,709 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (13709)

Base System Value
2 Binary 11010110001101
3 Ternary 200210202
4 Quaternary 3112031
5 Quinary 414314
6 Senary 143245
8 Octal 32615
10 Decimal 13709
12 Duodecimal 7b25
20 Vigesimal 1e59
36 Base36 akt

## Basic calculations (n = 13709)

### Multiplication

n×y
 n×2 27418 41127 54836 68545

### Division

n÷y
 n÷2 6854.5 4569.67 3427.25 2741.8

### Exponentiation

ny
 n2 187936681 2576423959829 35320196065295761 484204567859139587549

### Nth Root

y√n
 2√n 117.085 23.9333 10.8206 6.72049

## 13709 as geometric shapes

### Circle

 Diameter 27418 86136.2 5.9042e+08

### Sphere

 Volume 1.07921e+13 2.36168e+09 86136.2

### Square

Length = n
 Perimeter 54836 1.87937e+08 19387.5

### Cube

Length = n
 Surface area 1.12762e+09 2.57642e+12 23744.7

### Equilateral Triangle

Length = n
 Perimeter 41127 8.1379e+07 11872.3

### Triangular Pyramid

Length = n
 Surface area 3.25516e+08 3.03634e+11 11193.4

## Cryptographic Hash Functions

md5 3f64b203421386156d5ef92c600045c6 cf85a52f54a2f8ec7c6efc5dfb196f6e990b2d93 5a20ae488936fbffa8f8cc7083656ae1cf71fff0737f38b55d51ea98ffe9da25 55918fb1cdf6ce8ac2fbe85277d1d401f5554c53965f8b34a51c5a69a9484d5d30f3402c3d3e789ff958a6448bfc529445020ab6c55c7cb51be0dd6cfc1aaeae 0d76ec4bac0e51f4130235764cc95b0b7838e52a
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}