## 29861

29,861 (twenty-nine thousand eight hundred sixty-one) is an odd five-digits composite number following 29860 and preceding 29862. In scientific notation, it is written as 2.9861 × 104. The sum of its digits is 26. It has a total of 2 prime factors and 4 positive divisors. There are 27,552 positive integers (up to 29861) that are relatively prime to 29861.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 26
• Digital Root 8

## Name

Short name 29 thousand 861 twenty-nine thousand eight hundred sixty-one

## Notation

Scientific notation 2.9861 × 104 29.861 × 103

## Prime Factorization of 29861

Prime Factorization 13 × 2297

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

## Divisors of 29861

1, 13, 2297, 29861

4 divisors

 Even divisors 0 4 4 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 32172 Sum of all the positive divisors of n s(n) 2311 Sum of the proper positive divisors of n A(n) 8043 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 172.803 Returns the nth root of the product of n divisors H(n) 3.71267 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 29,861 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 29,861) is 32,172, the average is 8,043.

## Other Arithmetic Functions (n = 29861)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 27552 Total number of positive integers not greater than n that are coprime to n λ(n) 6888 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 3236 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 27,552 positive integers (less than 29,861) that are coprime with 29,861. And there are approximately 3,236 prime numbers less than or equal to 29,861.

## Divisibility of 29861

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

29,861 is not divisible by any number less than or equal to 9.

## Classification of 29861

• Arithmetic
• Semiprime
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (29861)

Base System Value
2 Binary 111010010100101
3 Ternary 1111221222
4 Quaternary 13102211
5 Quinary 1423421
6 Senary 350125
8 Octal 72245
10 Decimal 29861
12 Duodecimal 15345
20 Vigesimal 3ed1
36 Base36 n1h

## Basic calculations (n = 29861)

### Multiplication

n×i
 n×2 59722 89583 119444 149305

### Division

ni
 n⁄2 14930.5 9953.67 7465.25 5972.2

### Exponentiation

ni
 n2 891679321 26626436204381 795092011499021041 23742242555372267305301

### Nth Root

i√n
 2√n 172.803 31.0243 13.1455 7.85273

## 29861 as geometric shapes

### Circle

 Diameter 59722 187622 2.80129e+09

### Sphere

 Volume 1.11533e+14 1.12052e+10 187622

### Square

Length = n
 Perimeter 119444 8.91679e+08 42229.8

### Cube

Length = n
 Surface area 5.35008e+09 2.66264e+13 51720.8

### Equilateral Triangle

Length = n
 Perimeter 89583 3.86108e+08 25860.4

### Triangular Pyramid

Length = n
 Surface area 1.54443e+09 3.13796e+12 24381.4
{"ft_lang_label":"__label__en","ft_lang_prob":0.610872,"math_prob":0.98911625,"size":4551,"snap":"2020-34-2020-40","text_gpt3_token_len":1601,"char_repetition_ratio":0.11897954,"word_repetition_ratio":0.029498525,"special_character_ratio":0.44715446,"punctuation_ratio":0.07564103,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9985368,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-29T02:16:45Z\",\"WARC-Record-ID\":\"<urn:uuid:71d1528e-c1cb-4e27-9029-2b9c86456487>\",\"Content-Length\":\"48172\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:06e9a6ce-a8e4-4a77-9ee1-13f99caafd38>\",\"WARC-Concurrent-To\":\"<urn:uuid:3f53b896-f663-4ce1-bfc0-0a5f655fe434>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/29861\",\"WARC-Payload-Digest\":\"sha1:RFVHI4YSHVAEW3ADDXZ3CRF65TF4MX6G\",\"WARC-Block-Digest\":\"sha1:SAKKB5YJULAGG2LAMII7PRHBTYUOMKPX\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600401617641.86_warc_CC-MAIN-20200928234043-20200929024043-00773.warc.gz\"}"}