## 27936

27,936 (twenty-seven thousand nine hundred thirty-six) is an even five-digits composite number following 27935 and preceding 27937. In scientific notation, it is written as 2.7936 × 104. The sum of its digits is 27. It has a total of 8 prime factors and 36 positive divisors. There are 9,216 positive integers (up to 27936) that are relatively prime to 27936.

## Basic properties

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

## Name

Short name 27 thousand 936 twenty-seven thousand nine hundred thirty-six

## Notation

Scientific notation 2.7936 × 104 27.936 × 103

## Prime Factorization of 27936

Prime Factorization 25 × 32 × 97

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 8 Total number of prime factors rad(n) 582 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 27,936 is 25 × 32 × 97. Since it has a total of 8 prime factors, 27,936 is a composite number.

## Divisors of 27936

1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 72, 96, 97, 144, 194, 288, 291, 388, 582, 776, 873, 1164, 1552, 1746, 2328, 3104, 3492, 4656, 6984, 9312, 13968, 27936

36 divisors

 Even divisors 30 6 4 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 36 Total number of the positive divisors of n σ(n) 80262 Sum of all the positive divisors of n s(n) 52326 Sum of the proper positive divisors of n A(n) 2229.5 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 167.141 Returns the nth root of the product of n divisors H(n) 12.5302 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 27,936 can be divided by 36 positive divisors (out of which 30 are even, and 6 are odd). The sum of these divisors (counting 27,936) is 80,262, the average is 222,9.5.

## Other Arithmetic Functions (n = 27936)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 9216 Total number of positive integers not greater than n that are coprime to n λ(n) 96 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 3049 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 9,216 positive integers (less than 27,936) that are coprime with 27,936. And there are approximately 3,049 prime numbers less than or equal to 27,936.

## Divisibility of 27936

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

The number 27,936 is divisible by 2, 3, 4, 6, 8 and 9.

• Refactorable
• Abundant

• Polite
• Practical

• Frugal

## Base conversion (27936)

Base System Value
2 Binary 110110100100000
3 Ternary 1102022200
4 Quaternary 12310200
5 Quinary 1343221
6 Senary 333200
8 Octal 66440
10 Decimal 27936
12 Duodecimal 14200
20 Vigesimal 39gg
36 Base36 lk0

## Basic calculations (n = 27936)

### Multiplication

n×i
 n×2 55872 83808 111744 139680

### Division

ni
 n⁄2 13968 9312 6984 5587.2

### Exponentiation

ni
 n2 780420096 21801815801856 609055526240649216 17014575181058776498176

### Nth Root

i√n
 2√n 167.141 30.3427 12.9283 7.74877

## 27936 as geometric shapes

### Circle

 Diameter 55872 175527 2.45176e+09

### Sphere

 Volume 9.13232e+13 9.80705e+09 175527

### Square

Length = n
 Perimeter 111744 7.8042e+08 39507.5

### Cube

Length = n
 Surface area 4.68252e+09 2.18018e+13 48386.6

### Equilateral Triangle

Length = n
 Perimeter 83808 3.37932e+08 24193.3

### Triangular Pyramid

Length = n
 Surface area 1.35173e+09 2.56937e+12 22809.6

## Cryptographic Hash Functions

md5 a73d731082fabe880672f123d4b3dcfe 1be2f0c6169e17792f0f384dca21c3cf65f9bd86 8118e5b2c9aed278381f15fe08dfb7f955070a1bd53d6464127f6ee3680bcb3a 520551485c4b308e4ba366afdeef48120a5181a564cb6a53519f5ee34ea92c447579b7082b89e24da5ffda696099e0a4d6046498d174099c9655a2379bf93b24 374636250bc82198ce3335923e95c82aef8e787f
{"ft_lang_label":"__label__en","ft_lang_prob":0.64188164,"math_prob":0.9817507,"size":4519,"snap":"2020-34-2020-40","text_gpt3_token_len":1598,"char_repetition_ratio":0.1200443,"word_repetition_ratio":0.025110783,"special_character_ratio":0.45496792,"punctuation_ratio":0.08173691,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9944279,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-20T00:11:54Z\",\"WARC-Record-ID\":\"<urn:uuid:be9216b2-8985-4c30-ae00-35ab9801b5d2>\",\"Content-Length\":\"48917\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7db29302-04e6-4e44-a2bf-69a0a50886eb>\",\"WARC-Concurrent-To\":\"<urn:uuid:bb2fecb8-ef58-4fc8-82ff-773c5062ca2e>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/27936\",\"WARC-Payload-Digest\":\"sha1:OBNZTQJSBAMEJWE4UT4FTDICW73PHHWG\",\"WARC-Block-Digest\":\"sha1:EJAI55XPTI2P2MCYOYSORXRIT5E4Q6PW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400193087.0_warc_CC-MAIN-20200920000137-20200920030137-00464.warc.gz\"}"}