## 29450

29,450 (twenty-nine thousand four hundred fifty) is an even five-digits composite number following 29449 and preceding 29451. In scientific notation, it is written as 2.945 × 104. The sum of its digits is 20. It has a total of 5 prime factors and 24 positive divisors. There are 10,800 positive integers (up to 29450) that are relatively prime to 29450.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 20
• Digital Root 2

## Name

Short name 29 thousand 450 twenty-nine thousand four hundred fifty

## Notation

Scientific notation 2.945 × 104 29.45 × 103

## Prime Factorization of 29450

Prime Factorization 2 × 52 × 19 × 31

Composite number
Distinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 5 Total number of prime factors rad(n) 5890 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 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 29,450 is 2 × 52 × 19 × 31. Since it has a total of 5 prime factors, 29,450 is a composite number.

## Divisors of 29450

1, 2, 5, 10, 19, 25, 31, 38, 50, 62, 95, 155, 190, 310, 475, 589, 775, 950, 1178, 1550, 2945, 5890, 14725, 29450

24 divisors

 Even divisors 12 12 6 6
Total Divisors Sum of Divisors Aliquot Sum τ(n) 24 Total number of the positive divisors of n σ(n) 59520 Sum of all the positive divisors of n s(n) 30070 Sum of the proper positive divisors of n A(n) 2480 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 171.61 Returns the nth root of the product of n divisors H(n) 11.875 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 29,450 can be divided by 24 positive divisors (out of which 12 are even, and 12 are odd). The sum of these divisors (counting 29,450) is 59,520, the average is 2,480.

## Other Arithmetic Functions (n = 29450)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 10800 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) ≈ 3196 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 10,800 positive integers (less than 29,450) that are coprime with 29,450. And there are approximately 3,196 prime numbers less than or equal to 29,450.

## Divisibility of 29450

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

The number 29,450 is divisible by 2 and 5.

• Arithmetic
• Abundant

• Polite

## Base conversion (29450)

Base System Value
2 Binary 111001100001010
3 Ternary 1111101202
4 Quaternary 13030022
5 Quinary 1420300
6 Senary 344202
8 Octal 71412
10 Decimal 29450
12 Duodecimal 15062
20 Vigesimal 3dca
36 Base36 mq2

## Basic calculations (n = 29450)

### Multiplication

n×i
 n×2 58900 88350 117800 147250

### Division

ni
 n⁄2 14725 9816.67 7362.5 5890

### Exponentiation

ni
 n2 867302500 25542058625000 752213626506250000 22152691300609062500000

### Nth Root

i√n
 2√n 171.61 30.8813 13.1 7.831

## 29450 as geometric shapes

### Circle

 Diameter 58900 185040 2.72471e+09

### Sphere

 Volume 1.0699e+14 1.08988e+10 185040

### Square

Length = n
 Perimeter 117800 8.67302e+08 41648.6

### Cube

Length = n
 Surface area 5.20382e+09 2.55421e+13 51008.9

### Equilateral Triangle

Length = n
 Perimeter 88350 3.75553e+08 25504.4

### Triangular Pyramid

Length = n
 Surface area 1.50221e+09 3.01016e+12 24045.8

## Cryptographic Hash Functions

md5 0f450f46df1e06c6737e4ac25603c02a 391bbd0e2b43f9b0e03043fbe87999bf3910ebf1 45495bf6c9c6016c24a580cdca8380f3c3ca0a9d5af9d6e5a0bb26ae87a1877d a610fd40f91a2cb6c1557ca7c151555a6ecf73c48a6b044c4baed79e557d6a7b425588673cc3c1b54167b1a509a63368474a55b0730c7b9c59ed60420f1f680c 4cb94e4268a3aea026f5c2c0cd0753ca34eb8d65
{"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}