# 31089 (number)

31,089 (thirty-one thousand eighty-nine) is an odd five-digits composite number following 31088 and preceding 31090. In scientific notation, it is written as 3.1089 × 104. The sum of its digits is 21. It has a total of 3 prime factors and 8 positive divisors. There are 20,160 positive integers (up to 31089) that are relatively prime to 31089.

## Basic properties

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

## Name

Short name 31 thousand 89 thirty-one thousand eighty-nine

## Notation

Scientific notation 3.1089 × 104 31.089 × 103

## Prime Factorization of 31089

Prime Factorization 3 × 43 × 241

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 31089 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 31,089 is 3 × 43 × 241. Since it has a total of 3 prime factors, 31,089 is a composite number.

## Divisors of 31089

1, 3, 43, 129, 241, 723, 10363, 31089

8 divisors

 Even divisors 0 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 42592 Sum of all the positive divisors of n s(n) 11503 Sum of the proper positive divisors of n A(n) 5324 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 176.321 Returns the nth root of the product of n divisors H(n) 5.83941 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 31,089 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 31,089) is 42,592, the average is 5,324.

## Other Arithmetic Functions (n = 31089)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 20160 Total number of positive integers not greater than n that are coprime to n λ(n) 1680 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 3354 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 20,160 positive integers (less than 31,089) that are coprime with 31,089. And there are approximately 3,354 prime numbers less than or equal to 31,089.

## Divisibility of 31089

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

The number 31,089 is divisible by 3.

## Classification of 31089

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (31089)

Base System Value
2 Binary 111100101110001
3 Ternary 1120122110
4 Quaternary 13211301
5 Quinary 1443324
6 Senary 355533
8 Octal 74561
10 Decimal 31089
12 Duodecimal 15ba9
20 Vigesimal 3he9
36 Base36 nzl

## Basic calculations (n = 31089)

### Multiplication

n×y
 n×2 62178 93267 124356 155445

### Division

n÷y
 n÷2 15544.5 10363 7772.25 6217.8

### Exponentiation

ny
 n2 966525921 30048324357969 934172355964898241 29042484374592721414449

### Nth Root

y√n
 2√n 176.321 31.4438 13.2786 7.91628

## 31089 as geometric shapes

### Circle

 Diameter 62178 195338 3.03643e+09

### Sphere

 Volume 1.25866e+14 1.21457e+10 195338

### Square

Length = n
 Perimeter 124356 9.66526e+08 43966.5

### Cube

Length = n
 Surface area 5.79916e+09 3.00483e+13 53847.7

### Equilateral Triangle

Length = n
 Perimeter 93267 4.18518e+08 26923.9

### Triangular Pyramid

Length = n
 Surface area 1.67407e+09 3.54123e+12 25384.1

## Cryptographic Hash Functions

md5 c73edcecd97f8e999b5cd937d5e6827e 065c680cfe0d0ca95a6c8e5e695f796247d9d2d4 715e8d519610db31fdfc7fa0f443ddd2aa22be611497f9faa64f97e4da3dbfc3 f4452043f860bc516b042add36981fa59f3bdc5861d7a97f80c1e6d4ef2b53010ee138a58fb83e546753d8f4b519370ff0927316f8c04bf9c5fab5c4a3369838 1c1e16065335d516036a0ef620b87b395d813d30
{"ft_lang_label":"__label__en","ft_lang_prob":0.61639076,"math_prob":0.9855902,"size":4594,"snap":"2023-14-2023-23","text_gpt3_token_len":1820,"char_repetition_ratio":0.123965144,"word_repetition_ratio":0.026277373,"special_character_ratio":0.45015237,"punctuation_ratio":0.07468355,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9952259,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-08T15:44:15Z\",\"WARC-Record-ID\":\"<urn:uuid:c868b52e-d003-40a8-b6b6-c3363ceccedf>\",\"Content-Length\":\"40961\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4548ea19-0fac-42ef-9e1c-1c6645656f01>\",\"WARC-Concurrent-To\":\"<urn:uuid:b4798ea5-0d78-489a-b261-55f476ef1a7d>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/31089\",\"WARC-Payload-Digest\":\"sha1:IXFJXMIW4NFEKATKASJLBDGXG6KZIZVC\",\"WARC-Block-Digest\":\"sha1:QULG3NGJTPSL3OQC57J6RW4PPTVVH7AP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224655027.51_warc_CC-MAIN-20230608135911-20230608165911-00748.warc.gz\"}"}