4676 (number)

4,676 (four thousand six hundred seventy-six) is an even four-digits composite number following 4675 and preceding 4677. In scientific notation, it is written as 4.676 × 103. The sum of its digits is 23. It has a total of 4 prime factors and 12 positive divisors. There are 1,992 positive integers (up to 4676) that are relatively prime to 4676.

Basic properties

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

Name

Short name 4 thousand 676 four thousand six hundred seventy-six

Notation

Scientific notation 4.676 × 103 4.676 × 103

Prime Factorization of 4676

Prime Factorization 22 × 7 × 167

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 2338 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 4,676 is 22 × 7 × 167. Since it has a total of 4 prime factors, 4,676 is a composite number.

Divisors of 4676

1, 2, 4, 7, 14, 28, 167, 334, 668, 1169, 2338, 4676

12 divisors

 Even divisors 8 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 12 Total number of the positive divisors of n σ(n) 9408 Sum of all the positive divisors of n s(n) 4732 Sum of the proper positive divisors of n A(n) 784 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 68.3813 Returns the nth root of the product of n divisors H(n) 5.96429 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 4,676 can be divided by 12 positive divisors (out of which 8 are even, and 4 are odd). The sum of these divisors (counting 4,676) is 9,408, the average is 784.

Other Arithmetic Functions (n = 4676)

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

Divisibility of 4676

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

The number 4,676 is divisible by 2, 4 and 7.

Classification of 4676

• Arithmetic
• Abundant

Expressible via specific sums

• Polite
• Non-hypotenuse

• Pentagonal

Base conversion (4676)

Base System Value
2 Binary 1001001000100
3 Ternary 20102012
4 Quaternary 1021010
5 Quinary 122201
6 Senary 33352
8 Octal 11104
10 Decimal 4676
12 Duodecimal 2858
20 Vigesimal bdg
36 Base36 3lw

Basic calculations (n = 4676)

Multiplication

n×y
 n×2 9352 14028 18704 23380

Division

n÷y
 n÷2 2338 1558.67 1169 935.2

Exponentiation

ny
 n2 21864976 102240627776 478077175480576 2235488872547173376

Nth Root

y√n
 2√n 68.3813 16.7221 8.2693 5.4197

4676 as geometric shapes

Circle

 Diameter 9352 29380.2 6.86908e+07

Sphere

 Volume 4.28265e+11 2.74763e+08 29380.2

Square

Length = n
 Perimeter 18704 2.1865e+07 6612.86

Cube

Length = n
 Surface area 1.3119e+08 1.02241e+11 8099.07

Equilateral Triangle

Length = n
 Perimeter 14028 9.46781e+06 4049.53

Triangular Pyramid

Length = n
 Surface area 3.78712e+07 1.20492e+10 3817.94

Cryptographic Hash Functions

md5 ea6979872125d5acbac6068f186a0359 bf956e8a5cad73276dd026e0481ea5081e30357a ac1bd950b00370ca6500bf38c2bd05f90e5219fe84dc44dc41a8eaf860f39651 ff227d7c93b0fb906ab08533b8a9d86b050dea37d4a975744974b941a664a8a6ef03fb5e17a11d97acc1e69a57e3265e87587c1fe37b080b2ef10b0795a20f7a f518539f96ea834576d65a6708d0885c1dd1b020
{"ft_lang_label":"__label__en","ft_lang_prob":0.6376912,"math_prob":0.98663694,"size":4463,"snap":"2022-05-2022-21","text_gpt3_token_len":1591,"char_repetition_ratio":0.118187934,"word_repetition_ratio":0.025110783,"special_character_ratio":0.44454402,"punctuation_ratio":0.075835474,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9969905,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-16T22:49:18Z\",\"WARC-Record-ID\":\"<urn:uuid:804fde7c-52eb-40fb-858a-2cedb1f37bbe>\",\"Content-Length\":\"39748\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dea3c786-523b-4d08-8153-fd89416042fb>\",\"WARC-Concurrent-To\":\"<urn:uuid:2ca02158-6ecf-4a02-8843-6343914612cf>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/4676\",\"WARC-Payload-Digest\":\"sha1:SGSD5FIEFP7DYESUB5SC4EAE6Q5AXLOQ\",\"WARC-Block-Digest\":\"sha1:XWABG5BFCPWXJF3W5K7VVI7V3WZSUOYE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320300244.42_warc_CC-MAIN-20220116210734-20220117000734-00552.warc.gz\"}"}