## 5509

5,509 (five thousand five hundred nine) is an odd four-digits composite number following 5508 and preceding 5510. In scientific notation, it is written as 5.509 × 103. The sum of its digits is 19. It has a total of 2 prime factors and 4 positive divisors. There are 4,716 positive integers (up to 5509) that are relatively prime to 5509.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 4
• Sum of Digits 19
• Digital Root 1

## Name

Short name 5 thousand 509 five thousand five hundred nine

## Notation

Scientific notation 5.509 × 103 5.509 × 103

## Prime Factorization of 5509

Prime Factorization 7 × 787

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 5509 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 5,509 is 7 × 787. Since it has a total of 2 prime factors, 5,509 is a composite number.

## Divisors of 5509

1, 7, 787, 5509

4 divisors

 Even divisors 0 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 6304 Sum of all the positive divisors of n s(n) 795 Sum of the proper positive divisors of n A(n) 1576 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 74.2226 Returns the nth root of the product of n divisors H(n) 3.49556 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 5,509 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 5,509) is 6,304, the average is 1,576.

## Other Arithmetic Functions (n = 5509)

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

## Divisibility of 5509

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

The number 5,509 is divisible by 7.

## Classification of 5509

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (5509)

Base System Value
2 Binary 1010110000101
3 Ternary 21120001
4 Quaternary 1112011
5 Quinary 134014
6 Senary 41301
8 Octal 12605
10 Decimal 5509
12 Duodecimal 3231
20 Vigesimal df9
36 Base36 491

## Basic calculations (n = 5509)

### Multiplication

n×i
 n×2 11018 16527 22036 27545

### Division

ni
 n⁄2 2754.5 1836.33 1377.25 1101.8

### Exponentiation

ni
 n2 30349081 167193087229 921066717544561 5074156546952986549

### Nth Root

i√n
 2√n 74.2226 17.6614 8.61526 5.60034

## 5509 as geometric shapes

### Circle

 Diameter 11018 34614.1 9.53444e+07

### Sphere

 Volume 7.00337e+11 3.81378e+08 34614.1

### Square

Length = n
 Perimeter 22036 3.03491e+07 7790.9

### Cube

Length = n
 Surface area 1.82094e+08 1.67193e+11 9541.87

### Equilateral Triangle

Length = n
 Perimeter 16527 1.31415e+07 4770.93

### Triangular Pyramid

Length = n
 Surface area 5.25662e+07 1.97039e+10 4498.08
{"ft_lang_label":"__label__en","ft_lang_prob":0.63145334,"math_prob":0.98788726,"size":4442,"snap":"2021-04-2021-17","text_gpt3_token_len":1570,"char_repetition_ratio":0.11919784,"word_repetition_ratio":0.02818991,"special_character_ratio":0.44214317,"punctuation_ratio":0.07542263,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9987466,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-20T22:51:30Z\",\"WARC-Record-ID\":\"<urn:uuid:1aa0cad3-68eb-4858-b40d-87760b62aa60>\",\"Content-Length\":\"48192\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f3ee5768-d2e9-449f-9075-6b07febdfaba>\",\"WARC-Concurrent-To\":\"<urn:uuid:73a53783-84c0-465e-a3d8-8edd04c0a470>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/5509\",\"WARC-Payload-Digest\":\"sha1:DQWWW2HEXGTSNLMPOFSVM43J25LO5FYV\",\"WARC-Block-Digest\":\"sha1:HEKNIVFWHII54Q6BMC2RY3HZY5K7ZHZB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703522133.33_warc_CC-MAIN-20210120213234-20210121003234-00528.warc.gz\"}"}