# 5989 (number)

5,989 (five thousand nine hundred eighty-nine) is an odd four-digits composite number following 5988 and preceding 5990. In scientific notation, it is written as 5.989 × 103. The sum of its digits is 31. It has a total of 2 prime factors and 4 positive divisors. There are 5,824 positive integers (up to 5989) that are relatively prime to 5989.

## Basic properties

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

## Name

Short name 5 thousand 989 five thousand nine hundred eighty-nine

## Notation

Scientific notation 5.989 × 103 5.989 × 103

## Prime Factorization of 5989

Prime Factorization 53 × 113

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

## Divisors of 5989

1, 53, 113, 5989

4 divisors

 Even divisors 0 4 4 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 6156 Sum of all the positive divisors of n s(n) 167 Sum of the proper positive divisors of n A(n) 1539 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 77.3886 Returns the nth root of the product of n divisors H(n) 3.89149 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 5,989 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 5,989) is 6,156, the average is 1,539.

## Other Arithmetic Functions (n = 5989)

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

There are 5,824 positive integers (less than 5,989) that are coprime with 5,989. And there are approximately 787 prime numbers less than or equal to 5,989.

## Divisibility of 5989

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

5,989 is not divisible by any number less than or equal to 9.

## Classification of 5989

• Arithmetic
• Semiprime
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (5989)

Base System Value
2 Binary 1011101100101
3 Ternary 22012211
4 Quaternary 1131211
5 Quinary 142424
6 Senary 43421
8 Octal 13545
10 Decimal 5989
12 Duodecimal 3571
20 Vigesimal ej9
36 Base36 4md

## Basic calculations (n = 5989)

### Multiplication

n×y
 n×2 11978 17967 23956 29945

### Division

n÷y
 n÷2 2994.5 1996.33 1497.25 1197.8

### Exponentiation

ny
 n2 35868121 214814176669 1286522104070641 7704980881279068949

### Nth Root

y√n
 2√n 77.3886 18.1601 8.79708 5.6947

## 5989 as geometric shapes

### Circle

 Diameter 11978 37630 1.12683e+08

### Sphere

 Volume 8.99812e+11 4.50732e+08 37630

### Square

Length = n
 Perimeter 23956 3.58681e+07 8469.73

### Cube

Length = n
 Surface area 2.15209e+08 2.14814e+11 10373.3

### Equilateral Triangle

Length = n
 Perimeter 17967 1.55314e+07 5186.63

### Triangular Pyramid

Length = n
 Surface area 6.21254e+07 2.53161e+10 4890

## Cryptographic Hash Functions

md5 1ae6464c6b5d51b363d7d96f97132c75 1fddce6b252d9a996afdf789c3147025167128f9 c5920d177d5128b536850458be2a54aa8f1773659394b606eeecb3e919417ac1 32cac304b8ad663221883f8dfa78e5cc12a3993e97dcc697abfb5728fe9df45eeeb658615bb6bcdc7d4d0be312a4265f6a2011e8479fb31bd7d694e4892bd16a 8e63141e35bbf4837b8fdcdc224897fb1b254378
{"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}