## 15396

15,396 (fifteen thousand three hundred ninety-six) is an even five-digits composite number following 15395 and preceding 15397. In scientific notation, it is written as 1.5396 × 104. The sum of its digits is 24. It has a total of 4 prime factors and 12 positive divisors. There are 5,128 positive integers (up to 15396) that are relatively prime to 15396.

## Basic properties

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

## Name

Short name 15 thousand 396 fifteen thousand three hundred ninety-six

## Notation

Scientific notation 1.5396 × 104 15.396 × 103

## Prime Factorization of 15396

Prime Factorization 22 × 3 × 1283

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 7698 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 15,396 is 22 × 3 × 1283. Since it has a total of 4 prime factors, 15,396 is a composite number.

## Divisors of 15396

1, 2, 3, 4, 6, 12, 1283, 2566, 3849, 5132, 7698, 15396

12 divisors

 Even divisors 8 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 12 Total number of the positive divisors of n σ(n) 35952 Sum of all the positive divisors of n s(n) 20556 Sum of the proper positive divisors of n A(n) 2996 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 124.081 Returns the nth root of the product of n divisors H(n) 5.13885 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 15,396 can be divided by 12 positive divisors (out of which 8 are even, and 4 are odd). The sum of these divisors (counting 15,396) is 35,952, the average is 2,996.

## Other Arithmetic Functions (n = 15396)

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

## Divisibility of 15396

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

The number 15,396 is divisible by 2, 3, 4 and 6.

## Classification of 15396

• Arithmetic
• Refactorable
• Abundant

### Expressible via specific sums

• Polite
• Non-hypotenuse

## Base conversion (15396)

Base System Value
2 Binary 11110000100100
3 Ternary 210010020
4 Quaternary 3300210
5 Quinary 443041
6 Senary 155140
8 Octal 36044
10 Decimal 15396
12 Duodecimal 8ab0
20 Vigesimal 1i9g
36 Base36 bvo

## Basic calculations (n = 15396)

### Multiplication

n×i
 n×2 30792 46188 61584 76980

### Division

ni
 n⁄2 7698 5132 3849 3079.2

### Exponentiation

ni
 n2 237036816 3649418819136 56186452139417856 865046617138477310976

### Nth Root

i√n
 2√n 124.081 24.8773 11.1391 6.87831

## 15396 as geometric shapes

### Circle

 Diameter 30792 96735.9 7.44673e+08

### Sphere

 Volume 1.52866e+13 2.97869e+09 96735.9

### Square

Length = n
 Perimeter 61584 2.37037e+08 21773.2

### Cube

Length = n
 Surface area 1.42222e+09 3.64942e+12 26666.7

### Equilateral Triangle

Length = n
 Perimeter 46188 1.0264e+08 13333.3

### Triangular Pyramid

Length = n
 Surface area 4.1056e+08 4.30088e+11 12570.8

## Cryptographic Hash Functions

md5 5b46370c9fd40a27ce2b2abc281064de e77c425acc98bb8ff9ecf8e68c264a60816c40c6 016f6a283da4a0d09e616b756fd7dca90f07caadc9381d63e97edc61480bb8fe b073762028af5f5355a92fcea61053f1230164c86b896f920b4f49a065b1c1392863cf34987866b3a59e47bcc45703215c2d7ddd2a7b01bf198b86d04184c931 4be06509a8bf30a69fd9318e7ef4d6918f51c523
{"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/15396", "fetch_time": 1600975433000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2020-40/segments/1600400219691.59/warc/CC-MAIN-20200924163714-20200924193714-00581.warc.gz", "warc_record_offset": 526622371, "warc_record_length": 7484, "token_count": 1487, "char_count": 4162, "score": 3.609375, "int_score": 4, "crawl": "CC-MAIN-2020-40", "snapshot_type": "longest", "language": "en", "language_score": 0.8067758083343506, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00058-of-00064.parquet"}