Properties of the Number 5539

Five Thousand Five Hundred Thirty-Nine

Basics

Value: 5538 → 5539 → 5540

Parity: odd

Prime: No

Previous Prime: 5531

Next Prime: 5557

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 29 × 191

Divisors: 1, 29, 191, 5539

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010110100011

Octal: 12643

Duodecimal: 3257

Hexadecimal: 15a3

Square: 30680521

Square Root: 74.42445834535849

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 whose product of parts is >= n. A319005

Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1); triangle T(n,k), n>=0, read by rows. A243752

Composite numbers whose divisors (except 1) all contain the digit 9. A62680

Numbers k such that σ(k) = σ(k+10). A15880

Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet containing the k-th letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A293109

Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 6 multiples of n-1, n-2, ..., 1. A113743

a(n) = n*(7·n + 11)/2 + 1. A198017

Odd composites k such that for all divisor pairs (d, k/d), d <= k/d, it holds that k = A048720(k/d, A065621(d)). A391248

Triangle read by rows: T(n,k) is number of Dyck paths of semilength n and having k UDUD's (here U=(1,1), D=(1,-1)). A94507

The least number with exactly n ones in the continued fraction of its square root. A206578