## 13712

13,712 (thirteen thousand seven hundred twelve) is an even five-digits composite number following 13711 and preceding 13713. In scientific notation, it is written as 1.3712 × 104. The sum of its digits is 14. It has a total of 5 prime factors and 10 positive divisors. There are 6,848 positive integers (up to 13712) that are relatively prime to 13712.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 14
• Digital Root 5

## Name

Short name 13 thousand 712 thirteen thousand seven hundred twelve

## Notation

Scientific notation 1.3712 × 104 13.712 × 103

## Prime Factorization of 13712

Prime Factorization 24 × 857

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 5 Total number of prime factors rad(n) 1714 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 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) 0 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,712 is 24 × 857. Since it has a total of 5 prime factors, 13,712 is a composite number.

## Divisors of 13712

1, 2, 4, 8, 16, 857, 1714, 3428, 6856, 13712

10 divisors

 Even divisors 8 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 10 Total number of the positive divisors of n σ(n) 26598 Sum of all the positive divisors of n s(n) 12886 Sum of the proper positive divisors of n A(n) 2659.8 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 117.098 Returns the nth root of the product of n divisors H(n) 5.15527 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 13,712 can be divided by 10 positive divisors (out of which 8 are even, and 2 are odd). The sum of these divisors (counting 13,712) is 26,598, the average is 265,9.8.

## Other Arithmetic Functions (n = 13712)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 6848 Total number of positive integers not greater than n that are coprime to n λ(n) 856 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 6,848 positive integers (less than 13,712) that are coprime with 13,712. And there are approximately 1,623 prime numbers less than or equal to 13,712.

## Divisibility of 13712

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

The number 13,712 is divisible by 2, 4 and 8.

• Deficient

• Polite

• Frugal

## Base conversion (13712)

Base System Value
2 Binary 11010110010000
3 Ternary 200210212
4 Quaternary 3112100
5 Quinary 414322
6 Senary 143252
8 Octal 32620
10 Decimal 13712
12 Duodecimal 7b28
20 Vigesimal 1e5c
36 Base36 akw

## Basic calculations (n = 13712)

### Multiplication

n×i
 n×2 27424 41136 54848 68560

### Division

ni
 n⁄2 6856 4570.67 3428 2742.4

### Exponentiation

ni
 n2 188018944 2578115760128 35351123302875136 484734602729023864832

### Nth Root

i√n
 2√n 117.098 23.935 10.8212 6.72079

## 13712 as geometric shapes

### Circle

 Diameter 27424 86155 5.90679e+08

### Sphere

 Volume 1.07992e+13 2.36272e+09 86155

### Square

Length = n
 Perimeter 54848 1.88019e+08 19391.7

### Cube

Length = n
 Surface area 1.12811e+09 2.57812e+12 23749.9

### Equilateral Triangle

Length = n
 Perimeter 41136 8.14146e+07 11874.9

### Triangular Pyramid

Length = n
 Surface area 3.25658e+08 3.03834e+11 11195.8

## Cryptographic Hash Functions

md5 76edf3aeec7870bdbf0d146a95e611cc 7154fb6f5db6f5351aec8e2c09e1a2e73a13a289 ce8619672faf3172e05d46927ee12b24e6dfce825dd548d381998888459e0c7c 17aa6d85d5a7834318f032be9db2c9c2424a6dfaf7fa0142a1b3fcb23753c27b226dc63d8e7751bceb6b4569f8cfcdb4bd440eb08afe3b8e20d81bb86e604532 28f2538d7764cb13f0a87289b86555579e5fb85c
{"ft_lang_label":"__label__en","ft_lang_prob":0.6201971,"math_prob":0.98191977,"size":4449,"snap":"2020-34-2020-40","text_gpt3_token_len":1579,"char_repetition_ratio":0.12103487,"word_repetition_ratio":0.025525525,"special_character_ratio":0.44976398,"punctuation_ratio":0.0793238,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99591863,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-22T09:00:34Z\",\"WARC-Record-ID\":\"<urn:uuid:e586bc17-2ab8-4e69-af18-fd76a8f6f71b>\",\"Content-Length\":\"47809\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b2e7786a-4646-4f1d-83df-9a2e8eae8d39>\",\"WARC-Concurrent-To\":\"<urn:uuid:6c8d66ae-287d-443e-b160-e9725e88685c>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/13712\",\"WARC-Payload-Digest\":\"sha1:R4Z5W7KEIV3YQ5UKGQ6AYATWOV7TDSNJ\",\"WARC-Block-Digest\":\"sha1:E7ILX5U2RLZ5LAUABDFV2KYVIKFRWSP7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400204410.37_warc_CC-MAIN-20200922063158-20200922093158-00591.warc.gz\"}"}