## 384

384 (three hundred eighty-four) is an even three-digits composite number following 383 and preceding 385. In scientific notation, it is written as 3.84 × 102. The sum of its digits is 15. It has a total of 8 prime factors and 16 positive divisors. There are 128 positive integers (up to 384) that are relatively prime to 384.

## Basic properties

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

## Name

Short name 384 three hundred eighty-four

## Notation

Scientific notation 3.84 × 102 384 × 100

## Prime Factorization of 384

Prime Factorization 27 × 3

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 8 Total number of prime factors rad(n) 6 Product of the distinct prime numbers λ(n) 1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 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 384 is 27 × 3. Since it has a total of 8 prime factors, 384 is a composite number.

## Divisors of 384

1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 384

16 divisors

 Even divisors 14 2 1 1
Total Divisors Sum of Divisors Aliquot Sum τ(n) 16 Total number of the positive divisors of n σ(n) 1020 Sum of all the positive divisors of n s(n) 636 Sum of the proper positive divisors of n A(n) 63.75 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 19.5959 Returns the nth root of the product of n divisors H(n) 6.02353 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 384 can be divided by 16 positive divisors (out of which 14 are even, and 2 are odd). The sum of these divisors (counting 384) is 1,020, the average is 63,.75.

## Other Arithmetic Functions (n = 384)

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

## Divisibility of 384

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

The number 384 is divisible by 2, 3, 4, 6 and 8.

## Classification of 384

• Refactorable
• Abundant

### Expressible via specific sums

• Polite
• Practical
• Non-hypotenuse

• Frugal
• Regular

## Base conversion (384)

Base System Value
2 Binary 110000000
3 Ternary 112020
4 Quaternary 12000
5 Quinary 3014
6 Senary 1440
8 Octal 600
10 Decimal 384
12 Duodecimal 280
20 Vigesimal j4
36 Base36 ao

## Basic calculations (n = 384)

### Multiplication

n×i
 n×2 768 1152 1536 1920

### Division

ni
 n⁄2 192 128 96 76.8

### Exponentiation

ni
 n2 147456 56623104 21743271936 8349416423424

### Nth Root

i√n
 2√n 19.5959 7.26848 4.42673 3.2875

## 384 as geometric shapes

### Circle

 Diameter 768 2412.74 463247

### Sphere

 Volume 2.37182e+08 1.85299e+06 2412.74

### Square

Length = n
 Perimeter 1536 147456 543.058

### Cube

Length = n
 Surface area 884736 5.66231e+07 665.108

### Equilateral Triangle

Length = n
 Perimeter 1152 63850.3 332.554

### Triangular Pyramid

Length = n
 Surface area 255401 6.6731e+06 313.535

## Cryptographic Hash Functions

md5 0584ce565c824b7b7f50282d9a19945b b741f2520f68d7b8abfecea2d88015fc823ef8bb 37b73510175057c633ebe4beb0a34917fa2a0696432db43a4eeb2c3ff83a4c3b 6923fb884a330a38e5eb27910f67a0fb51994475678098eeb6eb88e4b03b12e23a74772f01616aa3725b5adef1943cb12dbe2b27cc8bc85ebf70d5843150d0bf 95a7eb545e773470f5930be0094b28f153b433ee
{"ft_lang_label":"__label__en","ft_lang_prob":0.63616663,"math_prob":0.9852244,"size":4314,"snap":"2021-04-2021-17","text_gpt3_token_len":1516,"char_repetition_ratio":0.11972158,"word_repetition_ratio":0.025373135,"special_character_ratio":0.43300882,"punctuation_ratio":0.06809079,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99599004,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-22T16:23:28Z\",\"WARC-Record-ID\":\"<urn:uuid:15f23ba5-acad-4208-bc1b-47e568d27d58>\",\"Content-Length\":\"48232\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e14cd900-6f5e-4b3b-9394-d22795c5f353>\",\"WARC-Concurrent-To\":\"<urn:uuid:d08183a4-f266-4aee-ae12-f4bf4f552993>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/384\",\"WARC-Payload-Digest\":\"sha1:FKWHEFBCYOICQ3RP2GU4ICWTW55NWSKZ\",\"WARC-Block-Digest\":\"sha1:GC5ODG4AV6NZ7BI4TDAEUA65CT252NXO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703530835.37_warc_CC-MAIN-20210122144404-20210122174404-00392.warc.gz\"}"}