Properties of the Number 5509

Five Thousand Five Hundred Nine

Basics

Value: 5508 → 5509 → 5510

Parity: odd

Prime: No

Previous Prime: 5507

Next Prime: 5519

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 × 787

Divisors: 1, 7, 787, 5509

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010110000101

Octal: 12605

Duodecimal: 3231

Hexadecimal: 1585

Square: 30349081

Square Root: 74.22263805605402

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Number of integer partitions of n into relatively prime parts that are all greater than 1. A302698

Expansion of 1/(1 - x + x² - x³ - x⁶ - x⁹ + x¹⁰ - x¹¹ + x¹²). A225499

Concentric 18-gonal numbers. A195147

a(n) = Frobenius number for 3 successive primes = F[p(n), p(n+1), p(n+2)]. A138989

T(n,k) is the number of -k..k arrays of n elements with first, second and third differences also in -k..k. A202124

a(n) = ∑_k=0..n k! * binomial(n,k) * binomial(2·n+1,k). A343832

Lower triangular matrix, read by rows: T(i,j) = number of ways i seats can be occupied by any number k (0<=k<=j<=i) of persons. A86885

T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 2..n-2. A180823

T(n,k)=Number of -k..k arrays of n elements with first through fourth differences also in -k..k. A202664

a(n) = n³ - n² + 1. A100104