# 12670 (number)

12,670 (twelve thousand six hundred seventy) is an even five-digits composite number following 12669 and preceding 12671. In scientific notation, it is written as 1.267 × 104. The sum of its digits is 16. It has a total of 4 prime factors and 16 positive divisors. There are 4,320 positive integers (up to 12670) that are relatively prime to 12670.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 16
• Digital Root 7

## Name

Short name 12 thousand 670 twelve thousand six hundred seventy

## Notation

Scientific notation 1.267 × 104 12.67 × 103

## Prime Factorization of 12670

Prime Factorization 2 × 5 × 7 × 181

Composite number
Distinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 12670 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 12,670 is 2 × 5 × 7 × 181. Since it has a total of 4 prime factors, 12,670 is a composite number.

## Divisors of 12670

1, 2, 5, 7, 10, 14, 35, 70, 181, 362, 905, 1267, 1810, 2534, 6335, 12670

16 divisors

 Even divisors 8 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 16 Total number of the positive divisors of n σ(n) 26208 Sum of all the positive divisors of n s(n) 13538 Sum of the proper positive divisors of n A(n) 1638 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 112.561 Returns the nth root of the product of n divisors H(n) 7.73504 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 12,670 can be divided by 16 positive divisors (out of which 8 are even, and 8 are odd). The sum of these divisors (counting 12,670) is 26,208, the average is 1,638.

## Other Arithmetic Functions (n = 12670)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 4320 Total number of positive integers not greater than n that are coprime to n λ(n) 180 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1514 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 4,320 positive integers (less than 12,670) that are coprime with 12,670. And there are approximately 1,514 prime numbers less than or equal to 12,670.

## Divisibility of 12670

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

The number 12,670 is divisible by 2, 5 and 7.

• Arithmetic
• Abundant

• Polite

• Square Free

## Base conversion (12670)

Base System Value
2 Binary 11000101111110
3 Ternary 122101021
4 Quaternary 3011332
5 Quinary 401140
6 Senary 134354
8 Octal 30576
10 Decimal 12670
12 Duodecimal 73ba
20 Vigesimal 1bda
36 Base36 9ry

## Basic calculations (n = 12670)

### Multiplication

n×y
 n×2 25340 38010 50680 63350

### Division

n÷y
 n÷2 6335 4223.33 3167.5 2534

### Exponentiation

ny
 n2 160528900 2033901163000 25769527735210000 326499916405110700000

### Nth Root

y√n
 2√n 112.561 23.3127 10.6095 6.61539

## 12670 as geometric shapes

### Circle

 Diameter 25340 79608 5.04316e+08

### Sphere

 Volume 8.51959e+12 2.01727e+09 79608

### Square

Length = n
 Perimeter 50680 1.60529e+08 17918.1

### Cube

Length = n
 Surface area 9.63173e+08 2.0339e+12 21945.1

### Equilateral Triangle

Length = n
 Perimeter 38010 6.95111e+07 10972.5

### Triangular Pyramid

Length = n
 Surface area 2.78044e+08 2.39698e+11 10345

## Cryptographic Hash Functions

md5 185afe2ab60395b0fb41349aa1469a7f 7529f418fd773633c3fa70579d79a2672e6dcb32 40ab9a2163d1791e76483d35eac76bb4b093b4b049e5e88da058a31f3c9f0d62 5ba3a6784f3aaadccb68d44c1df76e28d038b593f6a97c6527e96a376749c3031f0069a00b2fd636f0ea064511b7c2f87da093033618c7c39cc1b7fddd339ebd 3043529d94b6ab60c385d507e714bdd9b82c86ec
{"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}