## 28571

28,571 (twenty-eight thousand five hundred seventy-one) is an odd five-digits prime number following 28570 and preceding 28572. In scientific notation, it is written as 2.8571 × 104. The sum of its digits is 23. It has a total of 1 prime factor and 2 positive divisors. There are 28,570 positive integers (up to 28571) that are relatively prime to 28571.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 5
• Sum of Digits 23
• Digital Root 5

## Name

Short name 28 thousand 571 twenty-eight thousand five hundred seventy-one

## Notation

Scientific notation 2.8571 × 104 28.571 × 103

## Prime Factorization of 28571

Prime Factorization 28571

Prime number
Distinct Factors Total Factors Radical ω(n) 1 Total number of distinct prime factors Ω(n) 1 Total number of prime factors rad(n) 28571 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) 10.2601 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 28,571 is 28571. Since it has a total of 1 prime factor, 28,571 is a prime number.

## Divisors of 28571

2 divisors

 Even divisors 0 2 1 1
Total Divisors Sum of Divisors Aliquot Sum τ(n) 2 Total number of the positive divisors of n σ(n) 28572 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 14286 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 169.03 Returns the nth root of the product of n divisors H(n) 1.99993 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 28,571 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 28,571) is 28,572, the average is 14,286.

## Other Arithmetic Functions (n = 28571)

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

## Divisibility of 28571

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

28,571 is not divisible by any number less than or equal to 9.

## Classification of 28571

• Arithmetic
• Prime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Prime Power
• Square Free

## Base conversion (28571)

Base System Value
2 Binary 110111110011011
3 Ternary 1110012012
4 Quaternary 12332123
5 Quinary 1403241
6 Senary 340135
8 Octal 67633
10 Decimal 28571
12 Duodecimal 1464b
20 Vigesimal 3b8b
36 Base36 m1n

## Basic calculations (n = 28571)

### Multiplication

n×i
 n×2 57142 85713 114284 142855

### Division

ni
 n⁄2 14285.5 9523.67 7142.75 5714.2

### Exponentiation

ni
 n2 816302041 23322565613411 666349022140765681 19038257911583816271851

### Nth Root

i√n
 2√n 169.03 30.5709 13.0011 7.78368

## 28571 as geometric shapes

### Circle

 Diameter 57142 179517 2.56449e+09

### Sphere

 Volume 9.76933e+13 1.0258e+10 179517

### Square

Length = n
 Perimeter 114284 8.16302e+08 40405.5

### Cube

Length = n
 Surface area 4.89781e+09 2.33226e+13 49486.4

### Equilateral Triangle

Length = n
 Perimeter 85713 3.53469e+08 24743.2

### Triangular Pyramid

Length = n
 Surface area 1.41388e+09 2.74859e+12 23328.1

## Cryptographic Hash Functions

md5 5d7de12a8c0269c0ad4795f295a48b25 63884657a9105ab7ac5943b769956d812cd9178c 0274ae262499149a0abbf4827944c8f94d6c6674639df71cf41d628a0f06afde 1035b1c9a7f1a52420fb00f2dd741251b502ed5b095b8a6dbb837b2a65d2f3ddfacf6cc28ccddb99d7e46b2f13bdd0721053ec48cf7bbab7d8298899ed197f72 be24912bc7aa1617409c95c4a205405471270739
{"ft_lang_label":"__label__en","ft_lang_prob":0.6389873,"math_prob":0.9754936,"size":4535,"snap":"2021-31-2021-39","text_gpt3_token_len":1595,"char_repetition_ratio":0.12160671,"word_repetition_ratio":0.02962963,"special_character_ratio":0.45093715,"punctuation_ratio":0.075835474,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9963048,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-08-02T20:46:02Z\",\"WARC-Record-ID\":\"<urn:uuid:397bfcc8-8f6c-427a-8da2-7a5d8cfba2af>\",\"Content-Length\":\"59631\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4168c91d-dd9b-4d60-a1fa-855dfe5c3390>\",\"WARC-Concurrent-To\":\"<urn:uuid:667395c5-e7d3-449f-9e81-419535f62e90>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/28571\",\"WARC-Payload-Digest\":\"sha1:HNQUEUNRTTSYR7DFWPRN56VN3FU7VGON\",\"WARC-Block-Digest\":\"sha1:MIHMXTQPVP6DGJFXUIWGP6YPKLC3OAKW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046154385.24_warc_CC-MAIN-20210802203434-20210802233434-00530.warc.gz\"}"}