Properties of the Number 40660

Forty Thousand Six Hundred Sixty

Basics

Value: 40659 → 40660 → 40661

Parity: even

Prime: No

Previous Prime: 40639

Next Prime: 40693

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 5 × 19 × 107

Divisors: 1, 2, 4, 5, 10, 19, 20, 38, 76, 95

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001111011010100

Octal: 117324

Duodecimal: 1B644

Hexadecimal: 9ed4

Square: 1653235600

Square Root: 201.64324932910597

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

Expansion of (∏_j>=1 (1-(-x)^j) - 1)¹⁰ in powers of x. A1488

Numbers k such that σ(k) = σ(k+4). A15863

Larger of amicable pair m < n defined by t(n) = m and t(m) = n where t(n) = ψ(n) - n and ψ(n) = A001615(n) is the Dedekind ψ function. A323330

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 0, 1), (1, 0, 0), (1, 1, -1)}. A148615

Number of ways to write n as an ordered sum of ten positive Fibonacci numbers (with a single type of 1). A357730

Consider the 2ⁿ⁺¹ polynomials f(x) with coefficients 0 or 1 and degree <= n. Sequence gives triangle read by rows, in which T(n,k) (n>=0) is the number of such polynomials of thickness k (0 <= k <= n+1). A169945

Continued fraction for sqrt(687). A40660

Number of (n+2)X(2+2) 0..1 arrays with every 3X3 subblock sum of the two medians of the central row and column plus the two sums of the diagonal and antidiagonal nondecreasing horizontally and vertically. A256898