# 6822 (number)

6822 is an even four-digits composite number following 6821 and preceding 6823. In scientific notation, it is written as 6.822 × 103. The sum of its digits is 18. It has a total of 4 prime factors and 12 positive divisors. There are 2,268 positive integers (up to 6822) that are relatively prime to 6822.

## Basic properties

• Is Prime? no
• Number parity even
• Number length 4
• Sum of Digits 18
• Digital Root 9

## Name

Name six thousand eight hundred twenty-two

## Notation

Scientific notation 6.822 × 103 6.822 × 103

## Prime Factorization of 6822

Prime Factorization 2 × 32 × 379

Composite number
Distinct Factors Total Factors Radical ω 3 Total number of distinct prime factors Ω 4 Total number of prime factors rad 2274 Product of the distinct prime numbers λ 1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(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 Λ 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 6822 is 2 × 32 × 379. Since it has a total of 4 prime factors, 6822 is a composite number.

## Divisors of 6822

1, 2, 3, 6, 9, 18, 379, 758, 1137, 2274, 3411, 6822

12 divisors

 Even divisors 6 6 3 3
Total Divisors Sum of Divisors Aliquot Sum τ 12 Total number of the positive divisors of n σ 14820 Sum of all the positive divisors of n s 7998 Sum of the proper positive divisors of n A 1235 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G 82.5954 Returns the nth root of the product of n divisors H 5.52389 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 6822 can be divided by 12 positive divisors (out of which 6 are even, and 6 are odd). The sum of these divisors (counting 6822) is 14820, the average is 1235.

## Other Arithmetic Functions (n = 6822)

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

There are 2,268 positive integers (less than 6822) that are coprime with 6822. And there are approximately 881 prime numbers less than or equal to 6822.

## Divisibility of 6822

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

The number 6822 is divisible by 2, 3, 6 and 9.

## Classification of 6822

• Arithmetic
• Abundant

### Expressible via specific sums

• Polite
• Non hypotenuse

## Base conversion 6822

Base System Value
2 Binary 1101010100110
3 Ternary 100100200
4 Quaternary 1222212
5 Quinary 204242
6 Senary 51330
8 Octal 15246
10 Decimal 6822
12 Duodecimal 3b46
20 Vigesimal h12
36 Base36 59i

## Basic calculations (n = 6822)

### Multiplication

n×y
 n×2 13644 20466 27288 34110

### Division

n÷y
 n÷2 3411 2274 1705.5 1364.4

### Exponentiation

ny
 n2 46539684 317493724248 2165942186819856 14776057598485057632

### Nth Root

y√n
 2√n 82.5954 18.9658 9.0882 5.84497

## 6822 as geometric shapes

### Circle

 Diameter 13644 42863.9 1.46209e+08

### Sphere

 Volume 1.32991e+12 5.84835e+08 42863.9

### Square

Length = n
 Perimeter 27288 4.65397e+07 9647.76

### Cube

Length = n
 Surface area 2.79238e+08 3.17494e+11 11816.1

### Equilateral Triangle

Length = n
 Perimeter 20466 2.01523e+07 5908.03

### Triangular Pyramid

Length = n
 Surface area 8.06091e+07 3.7417e+10 5570.14

## Cryptographic Hash Functions

md5 e6be4c22a5963ab00dfe8f3b695b5332 82681d3d60f301b14ab5340cac4cdd279c110b86 ba144a526cbbdfd9f1be58f59d963a6fa041a2ad7e534afd1d7a1794127f27b5 48ea714891ae6a00fa2d5bfe2a4efa77ee709cdc140f2d24bfdb846012a6c50ce436332e1fce9ce5c934e1c3ab407eaa0cc4967de459f0c537d0cc900dbcf334 7c748d24d20434412deffea21f0763490690f8a0
{"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/6822", "fetch_time": 1718858600000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2024-26/segments/1718198861883.41/warc/CC-MAIN-20240620043158-20240620073158-00157.warc.gz", "warc_record_offset": 331948063, "warc_record_length": 7445, "token_count": 1417, "char_count": 3983, "score": 3.640625, "int_score": 4, "crawl": "CC-MAIN-2024-26", "snapshot_type": "latest", "language": "en", "language_score": 0.8156572580337524, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00008-of-00064.parquet"}