Properties of the Number 3670

Three Thousand Six Hundred Seventy

Basics

Value: 3669 → 3670 → 3671

Parity: even

Prime: No

Previous Prime: 3659

Next Prime: 3671

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 367

Divisors: 1, 2, 5, 10, 367, 734, 1835, 3670

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111001010110

Octal: 7126

Duodecimal: 215A

Hexadecimal: e56

Square: 13468900

Square Root: 60.58052492344384

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 n-node labeled graphs whose components are unicyclic graphs. A137916

Number of partitions of n having depth 1; see Comments. A237685

Number of cyclic arrangements of S={1,2,...,n} such that the difference between any two neighbors is at most 3. A242525

Triangle T(n,k) read by rows: number of k X k triangular matrices with nonnegative integer entries and without zero rows or columns such that sum of all entries is equal to n, n>=1, 1<=k<=n. A137251

Sum of the even parts appearing among the largest parts of the partitions of n into 3 parts. A309694

Sum of smallest parts (counted with multiplicity) of all partitions of n. A92309

Triangle read by rows where T(n,k) is the number of labeled loop-graphs on n vertices with k loops and n-k non-loops such that it is possible to choose a different vertex from each edge. A368924

Triangle read by rows: T(n,k) gives number of r-bicoverings of an n-set with k blocks, n >= 2, k = 3..n+floor(n/2). A60052

a(n) = A052217(n)/3. A88405

G.f. satisfies A(x) = (1 + x²)*(1 + x·A(x)²). A215576