# 27057 (number)

27,057 (twenty-seven thousand fifty-seven) is an odd five-digits composite number following 27056 and preceding 27058. In scientific notation, it is written as 2.7057 × 104. The sum of its digits is 21. It has a total of 3 prime factors and 8 positive divisors. There are 17,360 positive integers (up to 27057) that are relatively prime to 27057.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 21
• Digital Root 3

## Name

Short name 27 thousand 57 twenty-seven thousand fifty-seven

## Notation

Scientific notation 2.7057 × 104 27.057 × 103

## Prime Factorization of 27057

Prime Factorization 3 × 29 × 311

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

## Divisors of 27057

1, 3, 29, 87, 311, 933, 9019, 27057

8 divisors

 Even divisors 0 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 37440 Sum of all the positive divisors of n s(n) 10383 Sum of the proper positive divisors of n A(n) 4680 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 164.49 Returns the nth root of the product of n divisors H(n) 5.78141 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 27,057 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 27,057) is 37,440, the average is 4,680.

## Other Arithmetic Functions (n = 27057)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 17360 Total number of positive integers not greater than n that are coprime to n λ(n) 4340 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 2964 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 17,360 positive integers (less than 27,057) that are coprime with 27,057. And there are approximately 2,964 prime numbers less than or equal to 27,057.

## Divisibility of 27057

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

The number 27,057 is divisible by 3.

## Classification of 27057

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (27057)

Base System Value
2 Binary 110100110110001
3 Ternary 1101010010
4 Quaternary 12212301
5 Quinary 1331212
6 Senary 325133
8 Octal 64661
10 Decimal 27057
12 Duodecimal 137a9
20 Vigesimal 37ch
36 Base36 kvl

## Basic calculations (n = 27057)

### Multiplication

n×y
 n×2 54114 81171 108228 135285

### Division

n÷y
 n÷2 13528.5 9019 6764.25 5411.4

### Exponentiation

ny
 n2 732081249 19807922354193 535942955137400001 14501008537152631827057

### Nth Root

y√n
 2√n 164.49 30.0211 12.8254 7.69938

## 27057 as geometric shapes

### Circle

 Diameter 54114 170004 2.2999e+09

### Sphere

 Volume 8.29712e+13 9.1996e+09 170004

### Square

Length = n
 Perimeter 108228 7.32081e+08 38264.4

### Cube

Length = n
 Surface area 4.39249e+09 1.98079e+13 46864.1

### Equilateral Triangle

Length = n
 Perimeter 81171 3.17e+08 23432

### Triangular Pyramid

Length = n
 Surface area 1.268e+09 2.33439e+12 22091.9

## Cryptographic Hash Functions

md5 228b495ddf77bcfc7f5a57c1648599f9 6756ab6f0b92f5d3dca26c2d8510618902aa708f ce28800cc37e1a199586e55387d3e091076bb590b3bb3ebfc9a1e8c6af87020b c69a31dc0f5c03f004e884f6ba8bb683704e77a18a92d0cb5a1e0e73f766668c0db8b4c4bbe8ac48a199cb3a9f9355fd256afccbeb843af98a0c049bb6c4322c 7c44ea8f1aea34b2a25dac79ae54dbf2d05d8b00
{"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}