42675 (number)

42,675 (forty-two thousand six hundred seventy-five) is an odd five-digits composite number following 42674 and preceding 42676. In scientific notation, it is written as 4.2675 × 104. The sum of its digits is 24. It has a total of 4 prime factors and 12 positive divisors. There are 22,720 positive integers (up to 42675) that are relatively prime to 42675.

Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 24
• Digital Root 6

Name

Short name 42 thousand 675 forty-two thousand six hundred seventy-five

Notation

Scientific notation 4.2675 × 104 42.675 × 103

Prime Factorization of 42675

Prime Factorization 3 × 52 × 569

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

Divisors of 42675

1, 3, 5, 15, 25, 75, 569, 1707, 2845, 8535, 14225, 42675

12 divisors

 Even divisors 0 12 6 6
Total Divisors Sum of Divisors Aliquot Sum τ(n) 12 Total number of the positive divisors of n σ(n) 70680 Sum of all the positive divisors of n s(n) 28005 Sum of the proper positive divisors of n A(n) 5890 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 206.579 Returns the nth root of the product of n divisors H(n) 7.24533 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 42,675 can be divided by 12 positive divisors (out of which 0 are even, and 12 are odd). The sum of these divisors (counting 42,675) is 70,680, the average is 5,890.

Other Arithmetic Functions (n = 42675)

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

Divisibility of 42675

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

The number 42,675 is divisible by 3 and 5.

• Arithmetic
• Deficient

• Polite

Base conversion (42675)

Base System Value
2 Binary 1010011010110011
3 Ternary 2011112120
4 Quaternary 22122303
5 Quinary 2331200
6 Senary 525323
8 Octal 123263
10 Decimal 42675
12 Duodecimal 20843
20 Vigesimal 56df
36 Base36 wxf

Basic calculations (n = 42675)

Multiplication

n×y
 n×2 85350 128025 170700 213375

Division

n÷y
 n÷2 21337.5 14225 10668.8 8535

Exponentiation

ny
 n2 1821155625 77717816296875 3316607810469140625 141536238311770576171875

Nth Root

y√n
 2√n 206.579 34.9455 14.3729 8.43402

42675 as geometric shapes

Circle

 Diameter 85350 268135 5.72133e+09

Sphere

 Volume 3.25544e+14 2.28853e+10 268135

Square

Length = n
 Perimeter 170700 1.82116e+09 60351.6

Cube

Length = n
 Surface area 1.09269e+10 7.77178e+13 73915.3

Equilateral Triangle

Length = n
 Perimeter 128025 7.88584e+08 36957.6

Triangular Pyramid

Length = n
 Surface area 3.15433e+09 9.15913e+12 34844

Cryptographic Hash Functions

md5 1f218b10871e882b90a8dd82996cbdca 57173e6826f92a07cb89d6034769bc2f802072f3 39cce033ede0b44e5857351b25aef8d317267a2d0acd039e1a5502a25f3dd71c 39ae7c207936d5601cebfdd7454077a1c7643364babe991837829d2331d1310a94190722249f6f5ddb83d0ac9fc085060a2fd0c61c84353a7e8895dcf1483ad0 72b27e26d53474da09137cbb286c614b840170e1
{"ft_lang_label":"__label__en","ft_lang_prob":0.61290246,"math_prob":0.9898658,"size":4503,"snap":"2022-05-2022-21","text_gpt3_token_len":1592,"char_repetition_ratio":0.119804405,"word_repetition_ratio":0.0254491,"special_character_ratio":0.45791695,"punctuation_ratio":0.07622739,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9975016,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-19T05:25:50Z\",\"WARC-Record-ID\":\"<urn:uuid:f367c058-03eb-408a-96c1-ce9ebc83a833>\",\"Content-Length\":\"39249\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:84bb2157-0b89-4083-b50c-9c5ea6168902>\",\"WARC-Concurrent-To\":\"<urn:uuid:f41308d2-7a2f-4227-a878-2f0aacbba130>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/42675\",\"WARC-Payload-Digest\":\"sha1:KPZITDTLI4JNIESXEGZZL4M7KP6IHXHW\",\"WARC-Block-Digest\":\"sha1:S33FX4N2FZH5FUEVXDVXPJOACOA3EHER\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320301263.50_warc_CC-MAIN-20220119033421-20220119063421-00111.warc.gz\"}"}