# 32797 (number)

32,797 (thirty-two thousand seven hundred ninety-seven) is an odd five-digits prime number following 32796 and preceding 32798. In scientific notation, it is written as 3.2797 × 104. The sum of its digits is 28. It has a total of 1 prime factor and 2 positive divisors. There are 32,796 positive integers (up to 32797) that are relatively prime to 32797.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 5
• Sum of Digits 28
• Digital Root 1

## Name

Short name 32 thousand 797 thirty-two thousand seven hundred ninety-seven

## Notation

Scientific notation 3.2797 × 104 32.797 × 103

## Prime Factorization of 32797

Prime Factorization 32797

Prime number
Distinct Factors Total Factors Radical ω(n) 1 Total number of distinct prime factors Ω(n) 1 Total number of prime factors rad(n) 32797 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) 10.3981 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 32,797 is 32797. Since it has a total of 1 prime factor, 32,797 is a prime number.

## Divisors of 32797

2 divisors

 Even divisors 0 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 2 Total number of the positive divisors of n σ(n) 32798 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 16399 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 181.099 Returns the nth root of the product of n divisors H(n) 1.99994 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 32,797 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 32,797) is 32,798, the average is 16,399.

## Other Arithmetic Functions (n = 32797)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 32796 Total number of positive integers not greater than n that are coprime to n λ(n) 32796 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 3518 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 32,796 positive integers (less than 32,797) that are coprime with 32,797. And there are approximately 3,518 prime numbers less than or equal to 32,797.

## Divisibility of 32797

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

32,797 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (32797)

Base System Value
2 Binary 1000000000011101
3 Ternary 1122222201
4 Quaternary 20000131
5 Quinary 2022142
6 Senary 411501
8 Octal 100035
10 Decimal 32797
12 Duodecimal 16b91
20 Vigesimal 41jh
36 Base36 pb1

## Basic calculations (n = 32797)

### Multiplication

n×y
 n×2 65594 98391 131188 163985

### Division

n÷y
 n÷2 16398.5 10932.3 8199.25 6559.4

### Exponentiation

ny
 n2 1075643209 35277870325573 1157008313067817681 37946401643685216483757

### Nth Root

y√n
 2√n 181.099 32.0094 13.4573 8.00142

## 32797 as geometric shapes

### Circle

 Diameter 65594 206070 3.37923e+09

### Sphere

 Volume 1.47772e+14 1.35169e+10 206070

### Square

Length = n
 Perimeter 131188 1.07564e+09 46382

### Cube

Length = n
 Surface area 6.45386e+09 3.52779e+13 56806.1

### Equilateral Triangle

Length = n
 Perimeter 98391 4.65767e+08 28403

### Triangular Pyramid

Length = n
 Surface area 1.86307e+09 4.15754e+12 26778.6

## Cryptographic Hash Functions

md5 52e554cdb04f5149a995245284f2c62e 8c4ed8b299f5cea4e177b6add32d54ab6e8a9451 95fc3f55a49657076a4eb5b09bb9b7360d861af929a4cbe5cef14b7d4c526a29 12aca5b8ddfdb4632787449a57a89724e28965d8f29d101f51788cb783615792c9118a2947f894e64fbbba6eaa1d2c5d9ed4e574339159deec504981a30072eb 7c433833fb4c26839b6001159b1c7e22b037e658
{"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/32797", "fetch_time": 1686216804000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2023-23/segments/1685224654606.93/warc/CC-MAIN-20230608071820-20230608101820-00495.warc.gz", "warc_record_offset": 435083994, "warc_record_length": 7614, "token_count": 1425, "char_count": 4079, "score": 3.625, "int_score": 4, "crawl": "CC-MAIN-2023-23", "snapshot_type": "latest", "language": "en", "language_score": 0.8275649547576904, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00018-of-00064.parquet"}