# 26061 (number)

26,061 (twenty-six thousand sixty-one) is an odd five-digits composite number following 26060 and preceding 26062. In scientific notation, it is written as 2.6061 × 104. The sum of its digits is 15. It has a total of 4 prime factors and 16 positive divisors. There are 13,824 positive integers (up to 26061) that are relatively prime to 26061.

## Basic properties

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

## Name

Short name 26 thousand 61 twenty-six thousand sixty-one

## Notation

Scientific notation 2.6061 × 104 26.061 × 103

## Prime Factorization of 26061

Prime Factorization 3 × 7 × 17 × 73

Composite number
Distinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 26061 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 26,061 is 3 × 7 × 17 × 73. Since it has a total of 4 prime factors, 26,061 is a composite number.

## Divisors of 26061

1, 3, 7, 17, 21, 51, 73, 119, 219, 357, 511, 1241, 1533, 3723, 8687, 26061

16 divisors

 Even divisors 0 16 8 8
Total Divisors Sum of Divisors Aliquot Sum τ(n) 16 Total number of the positive divisors of n σ(n) 42624 Sum of all the positive divisors of n s(n) 16563 Sum of the proper positive divisors of n A(n) 2664 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 161.434 Returns the nth root of the product of n divisors H(n) 9.78266 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 26,061 can be divided by 16 positive divisors (out of which 0 are even, and 16 are odd). The sum of these divisors (counting 26,061) is 42,624, the average is 2,664.

## Other Arithmetic Functions (n = 26061)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 13824 Total number of positive integers not greater than n that are coprime to n λ(n) 144 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 2866 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 13,824 positive integers (less than 26,061) that are coprime with 26,061. And there are approximately 2,866 prime numbers less than or equal to 26,061.

## Divisibility of 26061

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

The number 26,061 is divisible by 3 and 7.

## Classification of 26061

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (26061)

Base System Value
2 Binary 110010111001101
3 Ternary 1022202020
4 Quaternary 12113031
5 Quinary 1313221
6 Senary 320353
8 Octal 62715
10 Decimal 26061
12 Duodecimal 130b9
20 Vigesimal 3531
36 Base36 k3x

## Basic calculations (n = 26061)

### Multiplication

n×y
 n×2 52122 78183 104244 130305

### Division

n÷y
 n÷2 13030.5 8687 6515.25 5212.2

### Exponentiation

ny
 n2 679175721 17699998464981 461279659995869841 12021409219152363926301

### Nth Root

y√n
 2√n 161.434 29.6481 12.7057 7.64184

## 26061 as geometric shapes

### Circle

 Diameter 52122 163746 2.13369e+09

### Sphere

 Volume 7.41416e+13 8.53477e+09 163746

### Square

Length = n
 Perimeter 104244 6.79176e+08 36855.8

### Cube

Length = n
 Surface area 4.07505e+09 1.77e+13 45139

### Equilateral Triangle

Length = n
 Perimeter 78183 2.94092e+08 22569.5

### Triangular Pyramid

Length = n
 Surface area 1.17637e+09 2.08596e+12 21278.7

## Cryptographic Hash Functions

md5 5c0321b6b78eecdfcf72e6a44222fef9 d6dbb77a4036e0fc337667f1937be7f572e47b95 f291c21082be932aea7a3f99708c4a4755ef51f670069b612e42c8420b637d60 f99305f35bacbf249f78fa0387986eede12d7d517663bcfbf7069416c0f53bad4bec12d32261d000fe48a7537638b7b66530852496cfc3b05ecf28cd24d64162 b4fbb67590f53f3a8252a1e02b0a2ba4a2b55b96
{"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}