# 28973 (number)

28,973 (twenty-eight thousand nine hundred seventy-three) is an odd five-digits composite number following 28972 and preceding 28974. In scientific notation, it is written as 2.8973 × 104. The sum of its digits is 29. It has a total of 2 prime factors and 4 positive divisors. There are 24,828 positive integers (up to 28973) that are relatively prime to 28973.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 29
• Digital Root 2

## Name

Short name 28 thousand 973 twenty-eight thousand nine hundred seventy-three

## Notation

Scientific notation 2.8973 × 104 28.973 × 103

## Prime Factorization of 28973

Prime Factorization 7 × 4139

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 28973 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 28,973 is 7 × 4139. Since it has a total of 2 prime factors, 28,973 is a composite number.

## Divisors of 28973

1, 7, 4139, 28973

4 divisors

 Even divisors 0 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 33120 Sum of all the positive divisors of n s(n) 4147 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) 170.215 Returns the nth root of the product of n divisors H(n) 3.49915 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 28,973 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 28,973) is 33,120, the average is 8,280.

## Other Arithmetic Functions (n = 28973)

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

## Divisibility of 28973

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

The number 28,973 is divisible by 7.

## Classification of 28973

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (28973)

Base System Value
2 Binary 111000100101101
3 Ternary 1110202002
4 Quaternary 13010231
5 Quinary 1411343
6 Senary 342045
8 Octal 70455
10 Decimal 28973
12 Duodecimal 14925
20 Vigesimal 3c8d
36 Base36 mct

## Basic calculations (n = 28973)

### Multiplication

n×y
 n×2 57946 86919 115892 144865

### Division

n÷y
 n÷2 14486.5 9657.67 7243.25 5794.6

### Exponentiation

ny
 n2 839434729 24320942403317 704650664251303441 20415843695353014596093

### Nth Root

y√n
 2√n 170.215 30.7136 13.0466 7.80546

## 28973 as geometric shapes

### Circle

 Diameter 57946 182043 2.63716e+09

### Sphere

 Volume 1.01875e+14 1.05486e+10 182043

### Square

Length = n
 Perimeter 115892 8.39435e+08 40974

### Cube

Length = n
 Surface area 5.03661e+09 2.43209e+13 50182.7

### Equilateral Triangle

Length = n
 Perimeter 86919 3.63486e+08 25091.4

### Triangular Pyramid

Length = n
 Surface area 1.45394e+09 2.86625e+12 23656.4

## Cryptographic Hash Functions

md5 e6ceb6cde9578ed6229ba2da69234a14 98b0df5a92786a77d4ca0aa048707b06df0e9fbf c3e004b4f5dfcdb59185e17e62d706220163357e67e54113f8822c73f4a2e8fa 3e0b849de38af18d2da5ad0f9cffa1d7b47a4e49bdd4debf1a690efeb1ac5494bd2dffc9067cb170653d309c0838d897cb7e36a17684c08cc2474ab467623eef 70a9fa60818d1778cc9e96e2d4c34a6f6758fe86
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://metanumbers.com/28973", "fetch_time": 1656429402000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2022-27/segments/1656103556871.29/warc/CC-MAIN-20220628142305-20220628172305-00776.warc.gz", "warc_record_offset": 446531023, "warc_record_length": 7359, "token_count": 1471, "char_count": 4194, "score": 3.546875, "int_score": 4, "crawl": "CC-MAIN-2022-27", "snapshot_type": "latest", "language": "en", "language_score": 0.812246561050415, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00045-of-00064.parquet"}