Properties of the Number 3669

Three Thousand Six Hundred Sixty-Nine

Basics

Value: 3668 → 3669 → 3670

Parity: odd

Prime: No

Previous Prime: 3659

Next Prime: 3671

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 1223

Divisors: 1, 3, 1223, 3669

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111001010101

Octal: 7125

Duodecimal: 2159

Hexadecimal: e55

Square: 13461561

Square Root: 60.572270883631234

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

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and height k (1 <= k <= n). A80936

a(n) = Fibonacci(n+1) - 2^floor(n/2). A5672

Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 24. A51965

Number of partitions of n such that 2*(least part) <= greatest part. A237821

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7. A252305

Numbers k such that 2^k - 19 is prime. A96819

Number T(n,k) of set partitions of [n] such that the maximal absolute difference between consecutive elements within a block equals k; triangle T(n,k), n>=0, 0<=k<=max(n-1,0), read by rows. A287213

Number of partitions of n where the difference between consecutive parts is at most 5. A238865

T(n,k)=Number of nXk 0..2 arrays with every 0 next to a 1 and every 1 next to a 2 horizontally, diagonally or antidiagonally. A232149

Same rule as Aitken triangle (A011971) except a(0,0)=1, a(1,0)=0. A46934