Properties of the Number 5607

Five Thousand Six Hundred Seven

Basics

Value: 5606 → 5607 → 5608

Parity: odd

Prime: No

Previous Prime: 5591

Next Prime: 5623

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 89

Divisors: 1, 3, 7, 9, 21, 63, 89, 267, 623, 801

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010111100111

Octal: 12747

Duodecimal: 32B3

Hexadecimal: 15e7

Square: 31438449

Square Root: 74.8799038460921

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

T(n,m) = number of 0..m-1 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171307

G.f.: ∏_{k>=1, j>=1} (1+x^j·k²). A280451

Number of n-node unlabeled connected graphs with one cycle of length 3. A226

a(n) = 3·a(n-2) - a(n-3), with a(0)=0, a(1)=a(2)=-3. A215665

Number of compositions (ordered partitions) of n into distinct parts >= 4. A339102

Numbers that are the sum of eight fifth powers in two or more ways. A345610

Numbers that are the sum of eight fifth powers in exactly two ways. A346327

Table, read by antidiagonals, in which the n-th row comprises A214206(n) in position 0 followed by a second order recursive series G in which each product G(i)*G(i+1) lies in the same row of A001477 (interpreted as a square array - see below). A182441

Number of partitions of n containing m(2) as a part, where m denotes multiplicity. A240487

Regular triangle where T(n,k) is the number of aperiodic multisets of size k that fit within some normal multiset of size n. A303974