## 5962

5,962 (five thousand nine hundred sixty-two) is an even four-digits composite number following 5961 and preceding 5963. In scientific notation, it is written as 5.962 × 103. The sum of its digits is 22. It has a total of 3 prime factors and 8 positive divisors. There are 2,700 positive integers (up to 5962) that are relatively prime to 5962.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 4
• Sum of Digits 22
• Digital Root 4

## Name

Short name 5 thousand 962 five thousand nine hundred sixty-two

## Notation

Scientific notation 5.962 × 103 5.962 × 103

## Prime Factorization of 5962

Prime Factorization 2 × 11 × 271

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

## Divisors of 5962

1, 2, 11, 22, 271, 542, 2981, 5962

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) 9792 Sum of all the positive divisors of n s(n) 3830 Sum of the proper positive divisors of n A(n) 1224 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 77.214 Returns the nth root of the product of n divisors H(n) 4.87092 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 5,962 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 5,962) is 9,792, the average is 1,224.

## Other Arithmetic Functions (n = 5962)

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

## Divisibility of 5962

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

The number 5,962 is divisible by 2.

## Classification of 5962

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

• Sphenic

## Base conversion (5962)

Base System Value
2 Binary 1011101001010
3 Ternary 22011211
4 Quaternary 1131022
5 Quinary 142322
6 Senary 43334
8 Octal 13512
10 Decimal 5962
12 Duodecimal 354a
20 Vigesimal ei2
36 Base36 4lm

## Basic calculations (n = 5962)

### Multiplication

n×i
 n×2 11924 17886 23848 29810

### Division

ni
 n⁄2 2981 1987.33 1490.5 1192.4

### Exponentiation

ni
 n2 35545444 211921937128 1263478589157136 7532859348554844832

### Nth Root

i√n
 2√n 77.214 18.1328 8.78715 5.68956

## 5962 as geometric shapes

### Circle

 Diameter 11924 37460.4 1.11669e+08

### Sphere

 Volume 8.87697e+11 4.46677e+08 37460.4

### Square

Length = n
 Perimeter 23848 3.55454e+07 8431.54

### Cube

Length = n
 Surface area 2.13273e+08 2.11922e+11 10326.5

### Equilateral Triangle

Length = n
 Perimeter 17886 1.53916e+07 5163.24

### Triangular Pyramid

Length = n
 Surface area 6.15665e+07 2.49752e+10 4867.95

## Cryptographic Hash Functions

md5 baeabb8ff01160eec0b5db7da2805f57 14925e51a51a2db8fa7f542644cc67360af88436 6ef3dcb7be11f8c49ebcf27b2bd215629cebe39577cd7a29e6005ffffb4a883d 3b207f8aa02598276bd0ffb0369c3954cd438efde183df7fa90ca83345efddfbd3c9799d85b4f1b280906c92302bb7fcb7c0a62e992250a28fd2c7199481ff36 16d45db3f908e8df5e5aa3ff9f45e2ff01140bb7
{"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/5962", "fetch_time": 1611467112000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-04/segments/1610703547333.68/warc/CC-MAIN-20210124044618-20210124074618-00551.warc.gz", "warc_record_offset": 455332610, "warc_record_length": 7428, "token_count": 1455, "char_count": 4090, "score": 3.765625, "int_score": 4, "crawl": "CC-MAIN-2021-04", "snapshot_type": "longest", "language": "en", "language_score": 0.8044655323028564, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00055-of-00064.parquet"}