## 44741

44,741 (forty-four thousand seven hundred forty-one) is an odd five-digits prime number following 44740 and preceding 44742. In scientific notation, it is written as 4.4741 × 104. The sum of its digits is 20. It has a total of 1 prime factor and 2 positive divisors. There are 44,740 positive integers (up to 44741) that are relatively prime to 44741.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 5
• Sum of Digits 20
• Digital Root 2

## Name

Short name 44 thousand 741 forty-four thousand seven hundred forty-one

## Notation

Scientific notation 4.4741 × 104 44.741 × 103

## Prime Factorization of 44741

Prime Factorization 44741

Prime number
Distinct Factors Total Factors Radical ω(n) 1 Total number of distinct prime factors Ω(n) 1 Total number of prime factors rad(n) 44741 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) 10.7086 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 44,741 is 44741. Since it has a total of 1 prime factor, 44,741 is a prime number.

## Divisors of 44741

2 divisors

 Even divisors 0 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 2 Total number of the positive divisors of n σ(n) 44742 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 22371 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 211.521 Returns the nth root of the product of n divisors H(n) 1.99996 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 44,741 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 44,741) is 44,742, the average is 22,371.

## Other Arithmetic Functions (n = 44741)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 44740 Total number of positive integers not greater than n that are coprime to n λ(n) 44740 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 4644 Total number of primes less than or equal to n r2(n) 8 The number of ways n can be represented as the sum of 2 squares

There are 44,740 positive integers (less than 44,741) that are coprime with 44,741. And there are approximately 4,644 prime numbers less than or equal to 44,741.

## Divisibility of 44741

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

44,741 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (44741)

Base System Value
2 Binary 1010111011000101
3 Ternary 2021101002
4 Quaternary 22323011
5 Quinary 2412431
6 Senary 543045
8 Octal 127305
10 Decimal 44741
12 Duodecimal 21a85
20 Vigesimal 5bh1
36 Base36 yit

## Basic calculations (n = 44741)

### Multiplication

n×i
 n×2 89482 134223 178964 223705

### Division

ni
 n⁄2 22370.5 14913.7 11185.2 8948.2

### Exponentiation

ni
 n2 2001757081 89560613561021 4007031411333640561 179278592374478412339701

### Nth Root

i√n
 2√n 211.521 35.5006 14.5438 8.51415

## 44741 as geometric shapes

### Circle

 Diameter 89482 281116 6.28871e+09

### Sphere

 Volume 3.75151e+14 2.51548e+10 281116

### Square

Length = n
 Perimeter 178964 2.00176e+09 63273.3

### Cube

Length = n
 Surface area 1.20105e+10 8.95606e+13 77493.7

### Equilateral Triangle

Length = n
 Perimeter 134223 8.66786e+08 38746.8

### Triangular Pyramid

Length = n
 Surface area 3.46714e+09 1.05548e+13 36530.9

## Cryptographic Hash Functions

md5 6b1e2c2e15d2f2696ea4e0f911334f6b d5ff8a1d9ebef4f5808631d77c2d00b532985f8f fbec0fd302daa13e81d5219770caa8dcc8d229e3d56ec5d262be96c9de036f36 9493905949475188d0d80132206861b44691ec28f302a03d371f1ce5740e7a7604aab8257edcba06e67482ccf05ec11363e8899193426414394f34aacef15f73 2e9c5f4618e4e731f1f35fe01da1b2b1dc64f8a9
{"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}