## 27293

27,293 (twenty-seven thousand two hundred ninety-three) is an odd five-digits composite number following 27292 and preceding 27294. In scientific notation, it is written as 2.7293 × 104. The sum of its digits is 23. It has a total of 3 prime factors and 6 positive divisors. There are 23,352 positive integers (up to 27293) that are relatively prime to 27293.

## Basic properties

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

## Name

Short name 27 thousand 293 twenty-seven thousand two hundred ninety-three

## Notation

Scientific notation 2.7293 × 104 27.293 × 103

## Prime Factorization of 27293

Prime Factorization 72 × 557

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

## Divisors of 27293

1, 7, 49, 557, 3899, 27293

6 divisors

 Even divisors 0 6 4 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 6 Total number of the positive divisors of n σ(n) 31806 Sum of all the positive divisors of n s(n) 4513 Sum of the proper positive divisors of n A(n) 5301 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 165.206 Returns the nth root of the product of n divisors H(n) 5.14865 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 27,293 can be divided by 6 positive divisors (out of which 0 are even, and 6 are odd). The sum of these divisors (counting 27,293) is 31,806, the average is 5,301.

## Other Arithmetic Functions (n = 27293)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 23352 Total number of positive integers not greater than n that are coprime to n λ(n) 11676 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 2987 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 23,352 positive integers (less than 27,293) that are coprime with 27,293. And there are approximately 2,987 prime numbers less than or equal to 27,293.

## Divisibility of 27293

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

The number 27,293 is divisible by 7.

• Arithmetic
• Deficient

• Polite

• Frugal

## Base conversion (27293)

Base System Value
2 Binary 110101010011101
3 Ternary 1101102212
4 Quaternary 12222131
5 Quinary 1333133
6 Senary 330205
8 Octal 65235
10 Decimal 27293
12 Duodecimal 13965
20 Vigesimal 384d
36 Base36 l25

## Basic calculations (n = 27293)

### Multiplication

n×i
 n×2 54586 81879 109172 136465

### Division

ni
 n⁄2 13646.5 9097.67 6823.25 5458.6

### Exponentiation

ni
 n2 744907849 20330769922757 554887703501806801 15144550091674813019693

### Nth Root

i√n
 2√n 165.206 30.1081 12.8532 7.71277

## 27293 as geometric shapes

### Circle

 Diameter 54586 171487 2.3402e+09

### Sphere

 Volume 8.51613e+13 9.36079e+09 171487

### Square

Length = n
 Perimeter 109172 7.44908e+08 38598.1

### Cube

Length = n
 Surface area 4.46945e+09 2.03308e+13 47272.9

### Equilateral Triangle

Length = n
 Perimeter 81879 3.22555e+08 23636.4

### Triangular Pyramid

Length = n
 Surface area 1.29022e+09 2.396e+12 22284.6

## Cryptographic Hash Functions

md5 81b669febd10363a78964e2ea652a9e6 0daccafc7c8837319b8444bf3a024def4ded3304 7735eb099b30beb5d09369c19ca6b90c4360252bdecf3e2d1ed536a2e9c37df1 08ffacadffee6ef6e8214900560556117771f51f27f89f1094e0fbb36f731a46e23c7ecee651f2b849d7d3a41fe34464b20e1c580b0aa442aca224081da76561 a4f47b6746a99b64776b9e7bb358e7cfc505a45a
{"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, "url": "https://metanumbers.com/27293", "fetch_time": 1600660725000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2020-40/segments/1600400198887.3/warc/CC-MAIN-20200921014923-20200921044923-00320.warc.gz", "warc_record_offset": 522286865, "warc_record_length": 7465, "token_count": 1427, "char_count": 4054, "score": 3.609375, "int_score": 4, "crawl": "CC-MAIN-2020-40", "snapshot_type": "latest", "language": "en", "language_score": 0.8123015761375427, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00025-of-00064.parquet"}