# 13810 (number)

13,810 (thirteen thousand eight hundred ten) is an even five-digits composite number following 13809 and preceding 13811. In scientific notation, it is written as 1.381 × 104. The sum of its digits is 13. It has a total of 3 prime factors and 8 positive divisors. There are 5,520 positive integers (up to 13810) that are relatively prime to 13810.

## Basic properties

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

## Name

Short name 13 thousand 810 thirteen thousand eight hundred ten

## Notation

Scientific notation 1.381 × 104 13.81 × 103

## Prime Factorization of 13810

Prime Factorization 2 × 5 × 1381

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 13810 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) 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,810 is 2 × 5 × 1381. Since it has a total of 3 prime factors, 13,810 is a composite number.

## Divisors of 13810

1, 2, 5, 10, 1381, 2762, 6905, 13810

8 divisors

 Even divisors 4 4 4 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 24876 Sum of all the positive divisors of n s(n) 11066 Sum of the proper positive divisors of n A(n) 3109.5 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 117.516 Returns the nth root of the product of n divisors H(n) 4.44123 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 13,810 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 13,810) is 24,876, the average is 310,9.5.

## Other Arithmetic Functions (n = 13810)

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

There are 5,520 positive integers (less than 13,810) that are coprime with 13,810. And there are approximately 1,634 prime numbers less than or equal to 13,810.

## Divisibility of 13810

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

The number 13,810 is divisible by 2 and 5.

• Deficient

• Polite

• Square Free

• Sphenic

## Base conversion (13810)

Base System Value
2 Binary 11010111110010
3 Ternary 200221111
4 Quaternary 3113302
5 Quinary 420220
6 Senary 143534
8 Octal 32762
10 Decimal 13810
12 Duodecimal 7baa
20 Vigesimal 1eaa
36 Base36 anm

## Basic calculations (n = 13810)

### Multiplication

n×y
 n×2 27620 41430 55240 69050

### Division

n÷y
 n÷2 6905 4603.33 3452.5 2762

### Exponentiation

ny
 n2 190716100 2633789341000 36372630799210000 502306031337090100000

### Nth Root

y√n
 2√n 117.516 23.9919 10.8405 6.73037

## 13810 as geometric shapes

### Circle

 Diameter 27620 86770.8 5.99152e+08

### Sphere

 Volume 1.10324e+13 2.39661e+09 86770.8

### Square

Length = n
 Perimeter 55240 1.90716e+08 19530.3

### Cube

Length = n
 Surface area 1.1443e+09 2.63379e+12 23919.6

### Equilateral Triangle

Length = n
 Perimeter 41430 8.25825e+07 11959.8

### Triangular Pyramid

Length = n
 Surface area 3.3033e+08 3.10395e+11 11275.8
{"ft_lang_label":"__label__en","ft_lang_prob":0.63087654,"math_prob":0.9937133,"size":4559,"snap":"2022-40-2023-06","text_gpt3_token_len":1804,"char_repetition_ratio":0.12513721,"word_repetition_ratio":0.026200874,"special_character_ratio":0.44746655,"punctuation_ratio":0.07585335,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.99864846,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-04T21:51:52Z\",\"WARC-Record-ID\":\"<urn:uuid:cd98d75e-d670-43a7-a9c7-e96d20ca0d59>\",\"Content-Length\":\"40486\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:db86402e-a569-4c85-9de0-ef305092a4e0>\",\"WARC-Concurrent-To\":\"<urn:uuid:f269ee21-41fc-4e2a-8c7f-6cca6af920c5>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/13810\",\"WARC-Payload-Digest\":\"sha1:XIQTLFWGWUB65B7IIL2LFZ4W3BKJQFUF\",\"WARC-Block-Digest\":\"sha1:ZG7DK64722KSNMSQLEJYZCUQZB33SXBQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764500154.33_warc_CC-MAIN-20230204205328-20230204235328-00590.warc.gz\"}"}