Properties of the Number 5684

Five Thousand Six Hundred Eighty-Four

Basics

Value: 5683 → 5684 → 5685

Parity: even

Prime: No

Previous Prime: 5683

Next Prime: 5689

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 7 ² × 29

Divisors: 1, 2, 4, 7, 14, 28, 29, 49, 58, 98

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011000110100

Octal: 13064

Duodecimal: 3358

Hexadecimal: 1634

Square: 32307856

Square Root: 75.39230729988306

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

p-INVERT of the positive integers (A000027), where p(S) = 1 - S - S². A289780

Triangle read by rows: T(n,c) = number of successive equalities in set partitions of n. A56857

a(1) = a(2) = a(3) = a(4) = a(5) = 1 and for n>5: a(n) = a(n-4) + a(n-5). A103372

a(n) = C(n,2)*Bell(n-2) (cf. A000217, A000110). A105479

Expansion of ∏_n>=1 (1+xⁿ)^prime(n). A61152

Sum of the sixth largest parts of the partitions of n into 10 squarefree parts. A326632

Number of paraffins. A5997

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 6. A183642

Triangle T(n,k) = number of element-subset partitions of {1..n} with n-k+1 equalities (n >= 1, 1 <= k <= n). A56860

a(n) = n²*(2·n+1). A99721