## 27171

27,171 (twenty-seven thousand one hundred seventy-one) is an odd five-digits composite number following 27170 and preceding 27172. In scientific notation, it is written as 2.7171 × 104. The sum of its digits is 18. It has a total of 3 prime factors and 6 positive divisors. There are 18,108 positive integers (up to 27171) that are relatively prime to 27171.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 18
• Digital Root 9

## Name

Short name 27 thousand 171 twenty-seven thousand one hundred seventy-one

## Notation

Scientific notation 2.7171 × 104 27.171 × 103

## Prime Factorization of 27171

Prime Factorization 32 × 3019

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

## Divisors of 27171

1, 3, 9, 3019, 9057, 27171

6 divisors

 Even divisors 0 6 3 3
Total Divisors Sum of Divisors Aliquot Sum τ(n) 6 Total number of the positive divisors of n σ(n) 39260 Sum of all the positive divisors of n s(n) 12089 Sum of the proper positive divisors of n A(n) 6543.33 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 164.836 Returns the nth root of the product of n divisors H(n) 4.15247 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 27,171 can be divided by 6 positive divisors (out of which 0 are even, and 6 are odd). The sum of these divisors (counting 27,171) is 39,260, the average is 65,43.,333.

## Other Arithmetic Functions (n = 27171)

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

There are 18,108 positive integers (less than 27,171) that are coprime with 27,171. And there are approximately 2,975 prime numbers less than or equal to 27,171.

## Divisibility of 27171

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

The number 27,171 is divisible by 3 and 9.

## Classification of 27171

• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

## Base conversion (27171)

Base System Value
2 Binary 110101000100011
3 Ternary 1101021100
4 Quaternary 12220203
5 Quinary 1332141
6 Senary 325443
8 Octal 65043
10 Decimal 27171
12 Duodecimal 13883
20 Vigesimal 37ib
36 Base36 kyr

## Basic calculations (n = 27171)

### Multiplication

n×i
 n×2 54342 81513 108684 135855

### Division

ni
 n⁄2 13585.5 9057 6792.75 5434.2

### Exponentiation

ni
 n2 738263241 20059350521211 545032613011824081 14809081128144272104851

### Nth Root

i√n
 2√n 164.836 30.0632 12.8389 7.70586

## 27171 as geometric shapes

### Circle

 Diameter 54342 170720 2.31932e+09

### Sphere

 Volume 8.40244e+13 9.27729e+09 170720

### Square

Length = n
 Perimeter 108684 7.38263e+08 38425.6

### Cube

Length = n
 Surface area 4.42958e+09 2.00594e+13 47061.6

### Equilateral Triangle

Length = n
 Perimeter 81513 3.19677e+08 23530.8

### Triangular Pyramid

Length = n
 Surface area 1.27871e+09 2.36402e+12 22185

## Cryptographic Hash Functions

md5 e3fe004c8a465494fcb14db3bb9f0ee1 48bbfeed1de065874a31e934000d62306b60f9b0 66f5acc7b6134602134f8534ecde80b1f325f0f4334522d07fccb351ac60aea4 b3dd51ee2f464cd48703069d1e32644ca362dd448625eee3f754b7d51df82ee7561fe88250744aea4a10f2f8132ec7ed755c464e40b7ff8a6477660c25a4f157 c0285123b3f86fbb8c27b55572d078f5a2b563a7
{"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}