## 14046

14,046 (fourteen thousand forty-six) is an even five-digits composite number following 14045 and preceding 14047. In scientific notation, it is written as 1.4046 × 104. The sum of its digits is 15. It has a total of 3 prime factors and 8 positive divisors. There are 4,680 positive integers (up to 14046) that are relatively prime to 14046.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 15
• Digital Root 6

## Name

Short name 14 thousand 46 fourteen thousand forty-six

## Notation

Scientific notation 1.4046 × 104 14.046 × 103

## Prime Factorization of 14046

Prime Factorization 2 × 3 × 2341

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

## Divisors of 14046

1, 2, 3, 6, 2341, 4682, 7023, 14046

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) 28104 Sum of all the positive divisors of n s(n) 14058 Sum of the proper positive divisors of n A(n) 3513 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 118.516 Returns the nth root of the product of n divisors H(n) 3.99829 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 14,046 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 14,046) is 28,104, the average is 3,513.

## Other Arithmetic Functions (n = 14046)

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

## Divisibility of 14046

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

The number 14,046 is divisible by 2, 3 and 6.

• Arithmetic
• Abundant

• Polite

• Square Free

• Sphenic

## Base conversion (14046)

Base System Value
2 Binary 11011011011110
3 Ternary 201021020
4 Quaternary 3123132
5 Quinary 422141
6 Senary 145010
8 Octal 33336
10 Decimal 14046
12 Duodecimal 8166
20 Vigesimal 1f26
36 Base36 au6

## Basic calculations (n = 14046)

### Multiplication

n×i
 n×2 28092 42138 56184 70230

### Division

ni
 n⁄2 7023 4682 3511.5 2809.2

### Exponentiation

ni
 n2 197290116 2771136969336 38923389871293456 546717934132187882976

### Nth Root

i√n
 2√n 118.516 24.1278 10.8865 6.75321

## 14046 as geometric shapes

### Circle

 Diameter 28092 88253.6 6.19805e+08

### Sphere

 Volume 1.16077e+13 2.47922e+09 88253.6

### Square

Length = n
 Perimeter 56184 1.9729e+08 19864

### Cube

Length = n
 Surface area 1.18374e+09 2.77114e+12 24328.4

### Equilateral Triangle

Length = n
 Perimeter 42138 8.54291e+07 12164.2

### Triangular Pyramid

Length = n
 Surface area 3.41717e+08 3.26582e+11 11468.5
{"ft_lang_label":"__label__en","ft_lang_prob":0.61870843,"math_prob":0.99167943,"size":4463,"snap":"2020-34-2020-40","text_gpt3_token_len":1582,"char_repetition_ratio":0.12087912,"word_repetition_ratio":0.028231798,"special_character_ratio":0.44880125,"punctuation_ratio":0.07662338,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99862564,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-30T18:57:35Z\",\"WARC-Record-ID\":\"<urn:uuid:7b077848-4d16-4ce7-9923-5b7e61cf226c>\",\"Content-Length\":\"48248\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f7321253-a4e5-4aca-b71e-46163c64ef5a>\",\"WARC-Concurrent-To\":\"<urn:uuid:ae79a08f-74dd-4ed4-9ff5-9681544aa73b>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/14046\",\"WARC-Payload-Digest\":\"sha1:NH3BRRKGPQWD7L4ZZHKZCC3FWGN2FLZE\",\"WARC-Block-Digest\":\"sha1:EHRQ4VQPJARJI2IXW7UOM6CLBMKBY5I2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600402127397.84_warc_CC-MAIN-20200930172714-20200930202714-00552.warc.gz\"}"}