# 39046 (number)

39,046 (thirty-nine thousand forty-six) is an even five-digits composite number following 39045 and preceding 39047. In scientific notation, it is written as 3.9046 × 104. The sum of its digits is 22. It has a total of 3 prime factors and 8 positive divisors. There are 16,728 positive integers (up to 39046) that are relatively prime to 39046.

## Basic properties

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

## Name

Short name 39 thousand 46 thirty-nine thousand forty-six

## Notation

Scientific notation 3.9046 × 104 39.046 × 103

## Prime Factorization of 39046

Prime Factorization 2 × 7 × 2789

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

## Divisors of 39046

1, 2, 7, 14, 2789, 5578, 19523, 39046

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) 66960 Sum of all the positive divisors of n s(n) 27914 Sum of the proper positive divisors of n A(n) 8370 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 197.601 Returns the nth root of the product of n divisors H(n) 4.66499 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 39,046 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 39,046) is 66,960, the average is 8,370.

## Other Arithmetic Functions (n = 39046)

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

## Divisibility of 39046

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

The number 39,046 is divisible by 2 and 7.

• Arithmetic
• Deficient

• Polite

• Square Free

• Sphenic

## Base conversion (39046)

Base System Value
2 Binary 1001100010000110
3 Ternary 1222120011
4 Quaternary 21202012
5 Quinary 2222141
6 Senary 500434
8 Octal 114206
10 Decimal 39046
12 Duodecimal 1a71a
20 Vigesimal 4hc6
36 Base36 u4m

## Basic calculations (n = 39046)

### Multiplication

n×y
 n×2 78092 117138 156184 195230

### Division

n÷y
 n÷2 19523 13015.3 9761.5 7809.2

### Exponentiation

ny
 n2 1524590116 59529145669336 2324375021804893456 90757547101393869882976

### Nth Root

y√n
 2√n 197.601 33.9254 14.057 8.28543

## 39046 as geometric shapes

### Circle

 Diameter 78092 245333 4.78964e+09

### Sphere

 Volume 2.49355e+14 1.91586e+10 245333

### Square

Length = n
 Perimeter 156184 1.52459e+09 55219.4

### Cube

Length = n
 Surface area 9.14754e+09 5.95291e+13 67629.7

### Equilateral Triangle

Length = n
 Perimeter 117138 6.60167e+08 33814.8

### Triangular Pyramid

Length = n
 Surface area 2.64067e+09 7.01558e+12 31880.9

## Cryptographic Hash Functions

md5 35b3dcbee0a27779b233779e06e69edb 8e76001ea262ec1ce0baae58d265a5a0e6c97147 1543acbb4ccf2b1b26d2fa8cf0e8ad0e2e35fd77277a5c35e5633c43e07a5e4e 84c91531ccc935364eb4eb10419257f30f34edafc0e0140d5d985ca2388f86309eaec62c2f0956503781a611470c4f35bf67a49fcee394cf576c3fbf96216d32 15b4cc1b523750174c0c8e121945f550eb8bab99
{"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/39046", "fetch_time": 1638372981000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-49/segments/1637964360803.6/warc/CC-MAIN-20211201143545-20211201173545-00549.warc.gz", "warc_record_offset": 471168207, "warc_record_length": 7362, "token_count": 1459, "char_count": 4080, "score": 3.640625, "int_score": 4, "crawl": "CC-MAIN-2021-49", "snapshot_type": "latest", "language": "en", "language_score": 0.8171975612640381, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00040-of-00064.parquet"}