# 10391 (number)

10,391 (ten thousand three hundred ninety-one) is an odd five-digits prime number following 10390 and preceding 10392. In scientific notation, it is written as 1.0391 × 104. The sum of its digits is 14. It has a total of 1 prime factor and 2 positive divisors. There are 10,390 positive integers (up to 10391) that are relatively prime to 10391.

## Basic properties

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

## Name

Short name 10 thousand 391 ten thousand three hundred ninety-one

## Notation

Scientific notation 1.0391 × 104 10.391 × 103

## Prime Factorization of 10391

Prime Factorization 10391

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

The prime factorization of 10,391 is 10391. Since it has a total of 1 prime factor, 10,391 is a prime number.

## Divisors of 10391

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) 10392 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 5196 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 101.936 Returns the nth root of the product of n divisors H(n) 1.99981 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 10,391 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 10,391) is 10,392, the average is 5,196.

## Other Arithmetic Functions (n = 10391)

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

## Divisibility of 10391

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

10,391 is not divisible by any number less than or equal to 9.

## Classification of 10391

• Arithmetic
• Prime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Prime Power
• Square Free

## Base conversion (10391)

Base System Value
2 Binary 10100010010111
3 Ternary 112020212
4 Quaternary 2202113
5 Quinary 313031
6 Senary 120035
8 Octal 24227
10 Decimal 10391
12 Duodecimal 601b
20 Vigesimal 15jb
36 Base36 80n

## Basic calculations (n = 10391)

### Multiplication

n×y
 n×2 20782 31173 41564 51955

### Division

n÷y
 n÷2 5195.5 3463.67 2597.75 2078.2

### Exponentiation

ny
 n2 107972881 1121946206471 11658143031440161 121139764239694712951

### Nth Root

y√n
 2√n 101.936 21.8216 10.0963 6.35816

## 10391 as geometric shapes

### Circle

 Diameter 20782 65288.6 3.39207e+08

### Sphere

 Volume 4.6996e+12 1.35683e+09 65288.6

### Square

Length = n
 Perimeter 41564 1.07973e+08 14695.1

### Cube

Length = n
 Surface area 6.47837e+08 1.12195e+12 17997.7

### Equilateral Triangle

Length = n
 Perimeter 31173 4.67536e+07 8998.87

### Triangular Pyramid

Length = n
 Surface area 1.87015e+08 1.32223e+11 8484.22

## Cryptographic Hash Functions

md5 5dfd38837dc134b2fc764c102b29fc46 f3d335b6ebd8616899eb7f95a668473a176c466a 30c124afa4ef4636a72491c48edc72a579571d46ff4e913ac37b2dea2fd1f418 a9cb95703e02ea9147460e5113d0edca22ca00d549ed0c87ef20d1ebfe045a151d182bd67ec46c648527bebae80db72efa67d666d8e25301474aa072c94401c9 a3aa2ece48a411c8a1784dff668b3c7bc17f620c
{"ft_lang_label":"__label__en","ft_lang_prob":0.6329047,"math_prob":0.9808119,"size":4591,"snap":"2022-27-2022-33","text_gpt3_token_len":1796,"char_repetition_ratio":0.12688032,"word_repetition_ratio":0.02761628,"special_character_ratio":0.4476149,"punctuation_ratio":0.07430731,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9963182,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-06-25T17:49:34Z\",\"WARC-Record-ID\":\"<urn:uuid:408101ae-88d7-4cdc-8342-2ce7bd593ca4>\",\"Content-Length\":\"39547\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:535b461e-2af1-4f18-8f97-624169dce1ea>\",\"WARC-Concurrent-To\":\"<urn:uuid:db12af46-0f87-4a11-97fa-9257c05c9951>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/10391\",\"WARC-Payload-Digest\":\"sha1:VK6O6CJFWFB6DINXX3MZ2JXWJFFYNDLB\",\"WARC-Block-Digest\":\"sha1:KS7ECD2NZQZ4UUJ52JRDB5ONPHLGZI5I\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656103036077.8_warc_CC-MAIN-20220625160220-20220625190220-00421.warc.gz\"}"}