## 15126

15,126 (fifteen thousand one hundred twenty-six) is an even five-digits composite number following 15125 and preceding 15127. In scientific notation, it is written as 1.5126 × 104. The sum of its digits is 15. It has a total of 3 prime factors and 8 positive divisors. There are 5,040 positive integers (up to 15126) that are relatively prime to 15126.

## Basic properties

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

## Name

Short name 15 thousand 126 fifteen thousand one hundred twenty-six

## Notation

Scientific notation 1.5126 × 104 15.126 × 103

## Prime Factorization of 15126

Prime Factorization 2 × 3 × 2521

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

## Divisors of 15126

1, 2, 3, 6, 2521, 5042, 7563, 15126

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) 30264 Sum of all the positive divisors of n s(n) 15138 Sum of the proper positive divisors of n A(n) 3783 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 122.988 Returns the nth root of the product of n divisors H(n) 3.99841 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

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

## Other Arithmetic Functions (n = 15126)

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

## Divisibility of 15126

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

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

• Arithmetic
• Abundant

• Polite

• Square Free

• Sphenic

## Base conversion (15126)

Base System Value
2 Binary 11101100010110
3 Ternary 202202020
4 Quaternary 3230112
5 Quinary 441001
6 Senary 154010
8 Octal 35426
10 Decimal 15126
12 Duodecimal 8906
16 Hexadecimal 3b16
20 Vigesimal 1hg6
36 Base36 bo6

## Basic calculations (n = 15126)

### Multiplication

n×i
 n×2 30252 45378 60504 75630

### Division

ni
 n⁄2 7563 5042 3781.5 3025.2

### Exponentiation

ni
 n2 228795876 3460766420376 52347552874607376 791809084781311169376

### Nth Root

i√n
 2√n 122.988 24.731 11.09 6.85401

## 15126 as geometric shapes

### Circle

Radius = n
 Diameter 30252 95039.5 7.18783e+08

### Sphere

Radius = n
 Volume 1.44964e+13 2.87513e+09 95039.5

### Square

Length = n
 Perimeter 60504 2.28796e+08 21391.4

### Cube

Length = n
 Surface area 1.37278e+09 3.46077e+12 26199

### Equilateral Triangle

Length = n
 Perimeter 45378 9.90715e+07 13099.5

### Triangular Pyramid

Length = n
 Surface area 3.96286e+08 4.07855e+11 12350.3

## Cryptographic Hash Functions

md5 e262bb94d2283745c350627f4334a11d f68c618bc3f8549705381c5fb645b702d17f0731 97401da47ce1de730fd5aa90eb628db9f47cc47a4dec0a8e71bb3d40a76c4790 2a86ab3dab736ff07518ee0c996493695fb721790570b8ee47681eacd54026e79ac654e2b41878c19a16fbe34ef13b3db2a2dcf8018b702959db8a16c4110df8 23697d643cc19e908b415293de947fda9556215b
{"ft_lang_label":"__label__en","ft_lang_prob":0.6298495,"math_prob":0.9868989,"size":4491,"snap":"2021-21-2021-25","text_gpt3_token_len":1585,"char_repetition_ratio":0.1201248,"word_repetition_ratio":0.028064992,"special_character_ratio":0.45201513,"punctuation_ratio":0.07622739,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.996407,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-24T00:47:10Z\",\"WARC-Record-ID\":\"<urn:uuid:abe86f7f-3c2f-47fc-91e0-3eccab798a23>\",\"Content-Length\":\"60010\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:eedf75e7-aadb-4eab-9997-1c7ed6bfb007>\",\"WARC-Concurrent-To\":\"<urn:uuid:e6d21e6a-e1fc-4e94-b7d7-100175ac87ca>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/15126\",\"WARC-Payload-Digest\":\"sha1:2LSX53DSFPKIAXF2CGRZJEAXJFJFATXY\",\"WARC-Block-Digest\":\"sha1:WFFJCQJQORSOUHACKGPVHGS2UVRKA6YJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623488544264.91_warc_CC-MAIN-20210623225535-20210624015535-00042.warc.gz\"}"}