## 6052

6,052 (six thousand fifty-two) is an even four-digits composite number following 6051 and preceding 6053. In scientific notation, it is written as 6.052 × 103. The sum of its digits is 13. It has a total of 4 prime factors and 12 positive divisors. There are 2,816 positive integers (up to 6052) that are relatively prime to 6052.

## Basic properties

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

## Name

Short name 6 thousand 52 six thousand fifty-two

## Notation

Scientific notation 6.052 × 103 6.052 × 103

## Prime Factorization of 6052

Prime Factorization 22 × 17 × 89

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 3026 Product of the distinct prime numbers λ(n) 1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 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 6,052 is 22 × 17 × 89. Since it has a total of 4 prime factors, 6,052 is a composite number.

## Divisors of 6052

1, 2, 4, 17, 34, 68, 89, 178, 356, 1513, 3026, 6052

12 divisors

 Even divisors 8 4 4 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 12 Total number of the positive divisors of n σ(n) 11340 Sum of all the positive divisors of n s(n) 5288 Sum of the proper positive divisors of n A(n) 945 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 77.7946 Returns the nth root of the product of n divisors H(n) 6.40423 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 6,052 can be divided by 12 positive divisors (out of which 8 are even, and 4 are odd). The sum of these divisors (counting 6,052) is 11,340, the average is 945.

## Other Arithmetic Functions (n = 6052)

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

## Divisibility of 6052

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

The number 6,052 is divisible by 2 and 4.

• Arithmetic
• Deficient

• Polite

## Base conversion (6052)

Base System Value
2 Binary 1011110100100
3 Ternary 22022011
4 Quaternary 1132210
5 Quinary 143202
6 Senary 44004
8 Octal 13644
10 Decimal 6052
12 Duodecimal 3604
20 Vigesimal f2c
36 Base36 4o4

## Basic calculations (n = 6052)

### Multiplication

n×i
 n×2 12104 18156 24208 30260

### Division

ni
 n⁄2 3026 2017.33 1513 1210.4

### Exponentiation

ni
 n2 36626704 221664812608 1341515445903616 8118851478608684032

### Nth Root

i√n
 2√n 77.7946 18.2235 8.82012 5.70663

## 6052 as geometric shapes

### Circle

 Diameter 12104 38025.8 1.15066e+08

### Sphere

 Volume 9.28507e+11 4.60265e+08 38025.8

### Square

Length = n
 Perimeter 24208 3.66267e+07 8558.82

### Cube

Length = n
 Surface area 2.1976e+08 2.21665e+11 10482.4

### Equilateral Triangle

Length = n
 Perimeter 18156 1.58598e+07 5241.19

### Triangular Pyramid

Length = n
 Surface area 6.34393e+07 2.61234e+10 4941.44
{"ft_lang_label":"__label__en","ft_lang_prob":0.62737626,"math_prob":0.9933119,"size":4361,"snap":"2021-04-2021-17","text_gpt3_token_len":1566,"char_repetition_ratio":0.11911866,"word_repetition_ratio":0.025641026,"special_character_ratio":0.44691584,"punctuation_ratio":0.07509881,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.9987926,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-23T01:47:03Z\",\"WARC-Record-ID\":\"<urn:uuid:0efd436a-4d09-4e0a-a8ac-6e7e9e3f99cc>\",\"Content-Length\":\"47448\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:11ab8366-700d-41c6-aca8-08cb5a7b677f>\",\"WARC-Concurrent-To\":\"<urn:uuid:6db6fb55-457e-45c9-8fbd-5d6af53b1196>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/6052\",\"WARC-Payload-Digest\":\"sha1:SSZ4LWCDYMAO5NRGB22VQWDR3RCGIU4T\",\"WARC-Block-Digest\":\"sha1:T2J5LXQ4RJZKNN7FHH2PZMNBQ75SJYGS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703531702.36_warc_CC-MAIN-20210123001629-20210123031629-00062.warc.gz\"}"}