# 15306 (number)

15,306 (fifteen thousand three hundred six) is an even five-digits composite number following 15305 and preceding 15307. In scientific notation, it is written as 1.5306 × 104. The sum of its digits is 15. It has a total of 3 prime factors and 8 positive divisors. There are 5,100 positive integers (up to 15306) that are relatively prime to 15306.

## Basic properties

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

## Name

Short name 15 thousand 306 fifteen thousand three hundred six

## Notation

Scientific notation 1.5306 × 104 15.306 × 103

## Prime Factorization of 15306

Prime Factorization 2 × 3 × 2551

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

## Divisors of 15306

1, 2, 3, 6, 2551, 5102, 7653, 15306

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) 30624 Sum of all the positive divisors of n s(n) 15318 Sum of the proper positive divisors of n A(n) 3828 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 123.717 Returns the nth root of the product of n divisors H(n) 3.99843 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 15,306 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 15,306) is 30,624, the average is 3,828.

## Other Arithmetic Functions (n = 15306)

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

## Divisibility of 15306

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

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

## Classification of 15306

• Arithmetic
• Abundant

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

• Sphenic

## Base conversion (15306)

Base System Value
2 Binary 11101111001010
3 Ternary 202222220
4 Quaternary 3233022
5 Quinary 442211
6 Senary 154510
8 Octal 35712
10 Decimal 15306
12 Duodecimal 8a36
20 Vigesimal 1i56
36 Base36 bt6

## Basic calculations (n = 15306)

### Multiplication

n×y
 n×2 30612 45918 61224 76530

### Division

n÷y
 n÷2 7653 5102 3826.5 3061.2

### Exponentiation

ny
 n2 234273636 3585792272616 54884136524660496 840056593646453551776

### Nth Root

y√n
 2√n 123.717 24.8287 11.1228 6.87025

## 15306 as geometric shapes

### Circle

 Diameter 30612 96170.4 7.35992e+08

### Sphere

 Volume 1.50201e+13 2.94397e+09 96170.4

### Square

Length = n
 Perimeter 61224 2.34274e+08 21646

### Cube

Length = n
 Surface area 1.40564e+09 3.58579e+12 26510.8

### Equilateral Triangle

Length = n
 Perimeter 45918 1.01443e+08 13255.4

### Triangular Pyramid

Length = n
 Surface area 4.05774e+08 4.2259e+11 12497.3

## Cryptographic Hash Functions

md5 3fc703661503434d7524267dfdd3e668 2e5edae9b8495b4ce9ac2a5f36bb84e63681d8ed 570934dfc7e7b82a01f593c4be55084b55d7f2f980c2b55b718ac72c5b3381b0 bb2a6b4a8b832ef541b88e92059e4b479094956e0cfaacb2bcbb415501e326da1668093f7bcae8d22c96da06e504ba895058c5dc8311eb2b803a05a0146cc92f 1e38e87e70727265e836dc763a12176da3eab701
{"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}