## 2021

2,021 (two thousand twenty-one) is an odd four-digits composite number following 2020 and preceding 2022. In scientific notation, it is written as 2.021 × 103. The sum of its digits is 5. It has a total of 2 prime factors and 4 positive divisors. There are 1,932 positive integers (up to 2021) that are relatively prime to 2021.

## Basic properties

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

## Name

Short name 2 thousand 21 two thousand twenty-one

## Notation

Scientific notation 2.021 × 103 2.021 × 103

## Prime Factorization of 2021

Prime Factorization 43 × 47

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 2021 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 2,021 is 43 × 47. Since it has a total of 2 prime factors, 2,021 is a composite number.

## Divisors of 2021

1, 43, 47, 2021

4 divisors

 Even divisors 0 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 2112 Sum of all the positive divisors of n s(n) 91 Sum of the proper positive divisors of n A(n) 528 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 44.9555 Returns the nth root of the product of n divisors H(n) 3.82765 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 2,021 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 2,021) is 2,112, the average is 528.

## Other Arithmetic Functions (n = 2021)

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

## Divisibility of 2021

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

2,021 is not divisible by any number less than or equal to 9.

## Classification of 2021

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (2021)

Base System Value
2 Binary 11111100101
3 Ternary 2202212
4 Quaternary 133211
5 Quinary 31041
6 Senary 13205
8 Octal 3745
10 Decimal 2021
12 Duodecimal 1205
20 Vigesimal 511
36 Base36 1k5

## Basic calculations (n = 2021)

### Multiplication

n×i
 n×2 4042 6063 8084 10105

### Division

ni
 n⁄2 1010.5 673.666 505.25 404.2

### Exponentiation

ni
 n2 4084441 8254655261 16682658282481 33715652388894101

### Nth Root

i√n
 2√n 44.9555 12.6432 6.70489 4.58261

## 2021 as geometric shapes

### Circle

 Diameter 4042 12698.3 1.28316e+07

### Sphere

 Volume 3.4577e+10 5.13266e+07 12698.3

### Square

Length = n
 Perimeter 8084 4.08444e+06 2858.13

### Cube

Length = n
 Surface area 2.45066e+07 8.25466e+09 3500.47

### Equilateral Triangle

Length = n
 Perimeter 6063 1.76861e+06 1750.24

### Triangular Pyramid

Length = n
 Surface area 7.07446e+06 9.7282e+08 1650.14

## Cryptographic Hash Functions

md5 05a5cf06982ba7892ed2a6d38fe832d6 fd93ac461456a118d38a8d6b4d18f6741682f3eb 1bea20e1df19b12013976de2b5e0e3d1fb4ba088b59fe53642c324298b21ffd9 36f2d92fbc0133539a36a91e3f63f02f875a1a1036006df2d26f8ae975625558d89e22a0f7a2f83ce7bbea76e2d1a236817e24b66cdf649e191319611a5adea6 839f80605a41ccd5eaa652f3dbfd8e5e69d8c145
{"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/2021", "fetch_time": 1603930583000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2020-45/segments/1603107902038.86/warc/CC-MAIN-20201028221148-20201029011148-00564.warc.gz", "warc_record_offset": 426113813, "warc_record_length": 7397, "token_count": 1452, "char_count": 4070, "score": 3.734375, "int_score": 4, "crawl": "CC-MAIN-2020-45", "snapshot_type": "longest", "language": "en", "language_score": 0.8146243095397949, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00035-of-00064.parquet"}