## 550489

550,489 (five hundred fifty thousand four hundred eighty-nine) is an odd six-digits prime number following 550488 and preceding 550490. In scientific notation, it is written as 5.50489 × 105. The sum of its digits is 31. It has a total of 1 prime factor and 2 positive divisors. There are 550,488 positive integers (up to 550489) that are relatively prime to 550489.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 6
• Sum of Digits 31
• Digital Root 4

## Name

Short name 550 thousand 489 five hundred fifty thousand four hundred eighty-nine

## Notation

Scientific notation 5.50489 × 105 550.489 × 103

## Prime Factorization of 550489

Prime Factorization 550489

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

The prime factorization of 550,489 is 550489. Since it has a total of 1 prime factor, 550,489 is a prime number.

## Divisors of 550489

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

The number 550,489 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 550,489) is 550,490, the average is 275,245.

## Other Arithmetic Functions (n = 550489)

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

## Divisibility of 550489

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

550,489 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (550489)

Base System Value
2 Binary 10000110011001011001
3 Ternary 1000222010111
4 Quaternary 2012121121
5 Quinary 120103424
6 Senary 15444321
8 Octal 2063131
10 Decimal 550489
12 Duodecimal 2266a1
20 Vigesimal 38g49
36 Base36 bsrd

## Basic calculations (n = 550489)

### Multiplication

n×i
 n×2 1100978 1651467 2201956 2752445

### Division

ni
 n⁄2 275244 183496 137622 110098

### Exponentiation

ni
 n2 303038139121 166819162166580169 91832113761918550652641 50552568472684781030221691449

### Nth Root

i√n
 2√n 741.949 81.9564 27.2387 14.0653

## 550489 as geometric shapes

### Circle

 Diameter 1.10098e+06 3.45882e+06 9.52022e+11

### Sphere

 Volume 6.9877e+17 3.80809e+12 3.45882e+06

### Square

Length = n
 Perimeter 2.20196e+06 3.03038e+11 778509

### Cube

Length = n
 Surface area 1.81823e+12 1.66819e+17 953475

### Equilateral Triangle

Length = n
 Perimeter 1.65147e+06 1.31219e+11 476737

### Triangular Pyramid

Length = n
 Surface area 5.24877e+11 1.96598e+16 449472

## Cryptographic Hash Functions

md5 45796e1728b6ca5b61c862811cf27ad4 5f0e11b2779e32a31a97c5cbb7b63f1c9d3c8a9f 9d117c3e90f1515be1869e49f8ab39cebd506d9c6e5ac9e685e3f5d17ae3e0d1 3f53dc621a5561a797d195d488971ddce0772465ac57b01661a13dc0d2d0d41530f4ac1f4331dc1ced145a1921974f3d488255b4c704e67cbe76df9eff5ae75c 32c7075c7780bdbb36d9dff619b0cbd0b66bf547
{"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}