## 13062

13,062 (thirteen thousand sixty-two) is an even five-digits composite number following 13061 and preceding 13063. In scientific notation, it is written as 1.3062 × 104. The sum of its digits is 12. It has a total of 4 prime factors and 16 positive divisors. There are 3,720 positive integers (up to 13062) that are relatively prime to 13062.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 12
• Digital Root 3

## Name

Short name 13 thousand 62 thirteen thousand sixty-two

## Notation

Scientific notation 1.3062 × 104 13.062 × 103

## Prime Factorization of 13062

Prime Factorization 2 × 3 × 7 × 311

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

## Divisors of 13062

1, 2, 3, 6, 7, 14, 21, 42, 311, 622, 933, 1866, 2177, 4354, 6531, 13062

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) 29952 Sum of all the positive divisors of n s(n) 16890 Sum of the proper positive divisors of n A(n) 1872 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 114.289 Returns the nth root of the product of n divisors H(n) 6.97756 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 13,062 can be divided by 16 positive divisors (out of which 8 are even, and 8 are odd). The sum of these divisors (counting 13,062) is 29,952, the average is 1,872.

## Other Arithmetic Functions (n = 13062)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 3720 Total number of positive integers not greater than n that are coprime to n λ(n) 930 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1555 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 3,720 positive integers (less than 13,062) that are coprime with 13,062. And there are approximately 1,555 prime numbers less than or equal to 13,062.

## Divisibility of 13062

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

The number 13,062 is divisible by 2, 3, 6 and 7.

## Classification of 13062

• Arithmetic
• Abundant

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

## Base conversion (13062)

Base System Value
2 Binary 11001100000110
3 Ternary 122220210
4 Quaternary 3030012
5 Quinary 404222
6 Senary 140250
8 Octal 31406
10 Decimal 13062
12 Duodecimal 7686
20 Vigesimal 1cd2
36 Base36 a2u

## Basic calculations (n = 13062)

### Multiplication

n×i
 n×2 26124 39186 52248 65310

### Division

ni
 n⁄2 6531 4354 3265.5 2612.4

### Exponentiation

ni
 n2 170615844 2228584154328 29109766223832336 380231766415697972832

### Nth Root

i√n
 2√n 114.289 23.5507 10.6906 6.65583

## 13062 as geometric shapes

### Circle

 Diameter 26124 82071 5.36005e+08

### Sphere

 Volume 9.33507e+12 2.14402e+09 82071

### Square

Length = n
 Perimeter 52248 1.70616e+08 18472.5

### Cube

Length = n
 Surface area 1.0237e+09 2.22858e+12 22624

### Equilateral Triangle

Length = n
 Perimeter 39186 7.38788e+07 11312

### Triangular Pyramid

Length = n
 Surface area 2.95515e+08 2.62641e+11 10665.1

## Cryptographic Hash Functions

md5 9d70ada63ee39c2f16e678bbf698df46 da8c7db5fa59db6618207b1ce2684033bba6f2d4 4ebe4e856947f64e28bf0fcd161d61732d38cb8a1ce51f6dd7ec164880ab8629 9a780f96b433fb08ae8e1a05542ee299a0b38da61c20ee624955e1fbd2559cc3805721af67853907a152dcfc33a0d84265458b02b1be7081d270f1b1577d3356 fc9b18c7c37c4c6cf96e7b5b86edc7b58f1228f8
{"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/13062", "fetch_time": 1627584690000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-31/segments/1627046153892.74/warc/CC-MAIN-20210729172022-20210729202022-00339.warc.gz", "warc_record_offset": 408726512, "warc_record_length": 10893, "token_count": 1495, "char_count": 4149, "score": 3.765625, "int_score": 4, "crawl": "CC-MAIN-2021-31", "snapshot_type": "longest", "language": "en", "language_score": 0.793365478515625, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00055-of-00064.parquet"}