## 14449

14,449 (fourteen thousand four hundred forty-nine) is an odd five-digits prime number following 14448 and preceding 14450. In scientific notation, it is written as 1.4449 × 104. The sum of its digits is 22. It has a total of 1 prime factor and 2 positive divisors. There are 14,448 positive integers (up to 14449) that are relatively prime to 14449.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 5
• Sum of Digits 22
• Digital Root 4

## Name

Short name 14 thousand 449 fourteen thousand four hundred forty-nine

## Notation

Scientific notation 1.4449 × 104 14.449 × 103

## Prime Factorization of 14449

Prime Factorization 14449

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

The prime factorization of 14,449 is 14449. Since it has a total of 1 prime factor, 14,449 is a prime number.

## Divisors of 14449

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) 14450 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 7225 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 120.204 Returns the nth root of the product of n divisors H(n) 1.99986 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 14,449 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 14,449) is 14,450, the average is 7,225.

## Other Arithmetic Functions (n = 14449)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 14448 Total number of positive integers not greater than n that are coprime to n λ(n) 14448 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1700 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 14,448 positive integers (less than 14,449) that are coprime with 14,449. And there are approximately 1,700 prime numbers less than or equal to 14,449.

## Divisibility of 14449

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

14,449 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (14449)

Base System Value
2 Binary 11100001110001
3 Ternary 201211011
4 Quaternary 3201301
5 Quinary 430244
6 Senary 150521
8 Octal 34161
10 Decimal 14449
12 Duodecimal 8441
20 Vigesimal 1g29
36 Base36 b5d

## Basic calculations (n = 14449)

### Multiplication

n×i
 n×2 28898 43347 57796 72245

### Division

ni
 n⁄2 7224.5 4816.33 3612.25 2889.8

### Exponentiation

ni
 n2 208773601 3016569760849 43586416474507201 629780131640154547249

### Nth Root

i√n
 2√n 120.204 24.3564 10.9638 6.79153

## 14449 as geometric shapes

### Circle

 Diameter 28898 90785.7 6.55882e+08

### Sphere

 Volume 1.26358e+13 2.62353e+09 90785.7

### Square

Length = n
 Perimeter 57796 2.08774e+08 20434

### Cube

Length = n
 Surface area 1.25264e+09 3.01657e+12 25026.4

### Equilateral Triangle

Length = n
 Perimeter 43347 9.04016e+07 12513.2

### Triangular Pyramid

Length = n
 Surface area 3.61606e+08 3.55506e+11 11797.6

## Cryptographic Hash Functions

md5 7f041c0dc0bc74c00d04f562504d778a 2741bb3c262cfba8bc28dd74950d3485a1bd49f6 a00b8671c08db0c9e22d1e3ef99e20f37cf2fca8626aa5950cd1b1ffa57f745b 96d744521489283cf346b12d7cf7ece4968433800f9d9580cb60f42aed6baf30d340f67875c88be576d991a66b5073a5cec4f3cf1daff4abfad5c429fb261815 386b6254d63777d62f824595d7a06effac49f103
{"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}