## 11122

11,122 (eleven thousand one hundred twenty-two) is an even five-digits composite number following 11121 and preceding 11123. In scientific notation, it is written as 1.1122 × 104. The sum of its digits is 7. It has a total of 3 prime factors and 8 positive divisors. There are 5,412 positive integers (up to 11122) that are relatively prime to 11122.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 7
• Digital Root 7

## Name

Short name 11 thousand 122 eleven thousand one hundred twenty-two

## Notation

Scientific notation 1.1122 × 104 11.122 × 103

## Prime Factorization of 11122

Prime Factorization 2 × 67 × 83

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 11122 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 11,122 is 2 × 67 × 83. Since it has a total of 3 prime factors, 11,122 is a composite number.

## Divisors of 11122

1, 2, 67, 83, 134, 166, 5561, 11122

8 divisors

 Even divisors 4 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 17136 Sum of all the positive divisors of n s(n) 6014 Sum of the proper positive divisors of n A(n) 2142 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 105.461 Returns the nth root of the product of n divisors H(n) 5.19234 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 11,122 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 11,122) is 17,136, the average is 2,142.

## Other Arithmetic Functions (n = 11122)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 5412 Total number of positive integers not greater than n that are coprime to n λ(n) 2706 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1350 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 5,412 positive integers (less than 11,122) that are coprime with 11,122. And there are approximately 1,350 prime numbers less than or equal to 11,122.

## Divisibility of 11122

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

The number 11,122 is divisible by 2.

## Classification of 11122

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Heptagonal

• Square Free

• Sphenic

## Base conversion (11122)

Base System Value
2 Binary 10101101110010
3 Ternary 120020221
4 Quaternary 2231302
5 Quinary 323442
6 Senary 123254
8 Octal 25562
10 Decimal 11122
12 Duodecimal 652a
20 Vigesimal 17g2
36 Base36 8ky

## Basic calculations (n = 11122)

### Multiplication

n×i
 n×2 22244 33366 44488 55610

### Division

ni
 n⁄2 5561 3707.33 2780.5 2224.4

### Exponentiation

ni
 n2 123698884 1375778987848 15301413902845456 170182325427447161632

### Nth Root

i√n
 2√n 105.461 22.3217 10.2694 6.4452

## 11122 as geometric shapes

### Circle

 Diameter 22244 69881.6 3.88612e+08

### Sphere

 Volume 5.76285e+12 1.55445e+09 69881.6

### Square

Length = n
 Perimeter 44488 1.23699e+08 15728.9

### Cube

Length = n
 Surface area 7.42193e+08 1.37578e+12 19263.9

### Equilateral Triangle

Length = n
 Perimeter 33366 5.35632e+07 9631.93

### Triangular Pyramid

Length = n
 Surface area 2.14253e+08 1.62137e+11 9081.07

## Cryptographic Hash Functions

md5 2bf0ccdbb4d3ebbcb990af74bd78c658 289ceabb721274eeb1b62cd787d84274e5ec6db8 8e3309ee6bb115d603ccf77649dcf1898d25ebd86635b35bb137dda002b0116a cc9c0db1a85509956c8c9d0f79b4ec9973d75ed56ed83debf575b0d7c8db4cf789b921a2889a085c97c7829551f78c665e65ffdbafa2d019cfed217f35895b60 777665894622e2dfbc61376a9313d57c91172227
{"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/11122", "fetch_time": 1624266854000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-25/segments/1623488269939.53/warc/CC-MAIN-20210621085922-20210621115922-00554.warc.gz", "warc_record_offset": 362751756, "warc_record_length": 10921, "token_count": 1465, "char_count": 4149, "score": 3.828125, "int_score": 4, "crawl": "CC-MAIN-2021-25", "snapshot_type": "latest", "language": "en", "language_score": 0.8049487471580505, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00031-of-00064.parquet"}