Properties of the Number 40261

Forty Thousand Two Hundred Sixty-One

Basics

Value: 40260 → 40261 → 40262

Parity: odd

Prime: No

Previous Prime: 40253

Next Prime: 40277

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 13 × 19 × 163

Divisors: 1, 13, 19, 163, 247, 2119, 3097, 40261

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001110101000101

Octal: 116505

Duodecimal: 1B371

Hexadecimal: 9d45

Square: 1620948121

Square Root: 200.65143906785218

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 1/((1+3·x)*(1-4·x)). A53404

G.f. satisfies: A(x) = (1+x) * A(x²)*A(x³)*A(x⁴)*...*A(xⁿ)*... A129373

Number of different partitions of the set {1, 2, ..., n} into an odd number of blocks such that each block contains at least 2 elements. A97762

Smallest number m such that ∑_k=1..m 1/prime(k) >= n/6. A103599

a(n) = a(n-1) + 3·a(n-2) -2·a(n-3) - 2·a(n-4), where a(0) = -2, a(1) = -1, a(2) = 2, a(3) = 1. A295853

T(n,k) = number of ways to place any number of 2 X 1 tiles of k distinguishable colors into an n X 1 grid; array read by descending antidiagonals, with n, k >= 1. A193376

Table by antidiagonals of T(n,k) = ((n+1)^k - (-n)^k)/(2·n+1). A72024

Array read by ascending antidiagonals. T(n, k) = J(k, n) where J are the Jacobsthal polynomials. A350470

Continued fraction for sqrt(278). A40261

Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 8. A252328