## 42274

42,274 (forty-two thousand two hundred seventy-four) is an even five-digits composite number following 42273 and preceding 42275. In scientific notation, it is written as 4.2274 × 104. The sum of its digits is 19. It has a total of 3 prime factors and 8 positive divisors. There are 20,196 positive integers (up to 42274) that are relatively prime to 42274.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 19
• Digital Root 1

## Name

Short name 42 thousand 274 forty-two thousand two hundred seventy-four

## Notation

Scientific notation 4.2274 × 104 42.274 × 103

## Prime Factorization of 42274

Prime Factorization 2 × 23 × 919

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 42274 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 42,274 is 2 × 23 × 919. Since it has a total of 3 prime factors, 42,274 is a composite number.

## Divisors of 42274

1, 2, 23, 46, 919, 1838, 21137, 42274

8 divisors

 Even divisors 4 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 66240 Sum of all the positive divisors of n s(n) 23966 Sum of the proper positive divisors of n A(n) 8280 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 205.606 Returns the nth root of the product of n divisors H(n) 5.10556 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 42,274 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 42,274) is 66,240, the average is 8,280.

## Other Arithmetic Functions (n = 42274)

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

## Divisibility of 42274

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

The number 42,274 is divisible by 2.

## Classification of 42274

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

• Sphenic

## Base conversion (42274)

Base System Value
2 Binary 1010010100100010
3 Ternary 2010222201
4 Quaternary 22110202
5 Quinary 2323044
6 Senary 523414
8 Octal 122442
10 Decimal 42274
12 Duodecimal 2056a
20 Vigesimal 55de
36 Base36 wma

## Basic calculations (n = 42274)

### Multiplication

n×i
 n×2 84548 126822 169096 211370

### Division

ni
 n⁄2 21137 14091.3 10568.5 8454.8

### Exponentiation

ni
 n2 1787091076 75547488146824 3193694513918837776 135010241881404948142624

### Nth Root

i√n
 2√n 205.606 34.8357 14.339 8.41811

## 42274 as geometric shapes

### Circle

 Diameter 84548 265615 5.61431e+09

### Sphere

 Volume 3.16453e+14 2.24572e+10 265615

### Square

Length = n
 Perimeter 169096 1.78709e+09 59784.5

### Cube

Length = n
 Surface area 1.07225e+10 7.55475e+13 73220.7

### Equilateral Triangle

Length = n
 Perimeter 126822 7.73833e+08 36610.4

### Triangular Pyramid

Length = n
 Surface area 3.09533e+09 8.90336e+12 34516.6

## Cryptographic Hash Functions

md5 cea2057aa773cb64e04f7a0bfae95f51 a655776a052a5ff0d09d9193a3e392656d601386 a8f962151da5c8f0dcede1e6d98ac52254de0b2ffabea2a894d145146d586fa7 8eb26682368732cc6d0b13bea50c2f61d41a93eed9b80758c130fe7a196d786cdeb0db6905f23dc4ef042604ffbfb0ad00cee5676694c86bebb30a29b7654433 835d74540cb4d68a471fec53914238698fb0f9be
{"ft_lang_label":"__label__en","ft_lang_prob":0.61488867,"math_prob":0.97106546,"size":4541,"snap":"2020-24-2020-29","text_gpt3_token_len":1601,"char_repetition_ratio":0.11880097,"word_repetition_ratio":0.028106509,"special_character_ratio":0.45078176,"punctuation_ratio":0.07593308,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9957859,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-14T08:03:59Z\",\"WARC-Record-ID\":\"<urn:uuid:14568bd4-63dd-4dbe-b2b3-1a48dfa3ba2c>\",\"Content-Length\":\"48319\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3e2cfa15-3b75-49f3-ae35-d2971fbf893c>\",\"WARC-Concurrent-To\":\"<urn:uuid:bcfc4f7b-3ea9-4cae-bd29-6eeaa58f6d3b>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/42274\",\"WARC-Payload-Digest\":\"sha1:SXKUSIKW5OCYSKD2JZQKKRZJR7FSU3DD\",\"WARC-Block-Digest\":\"sha1:GGBR54LYVUVXVNCXUCAQYRX3M25O56DL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593657149205.56_warc_CC-MAIN-20200714051924-20200714081924-00346.warc.gz\"}"}