Properties of the Number 40509

Forty Thousand Five Hundred Nine

Basics

Value: 40508 → 40509 → 40510

Parity: odd

Prime: No

Previous Prime: 40507

Next Prime: 40519

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 643

Divisors: 1, 3, 7, 9, 21, 63, 643, 1929, 4501, 5787

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001111000111101

Octal: 117075

Duodecimal: 1B539

Hexadecimal: 9e3d

Square: 1640979081

Square Root: 201.2684774126341

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

Irregular triangle read by rows: T(n,k) is the number of n-permutations whose third-shortest cycle has length exactly k; n >= 0, 0 <= k <= max(0,n-2). A350016

Array A(x,y) giving the position of the y-th·in A080237 listed by rising antidiagonals. A85178

Start with a square; at each stage add a square at each expandable vertex so that the ratio of the side of the squares at stage n+1 and at stage n is the golden ratio φ=0.618...; a(n) is the number of squares in a portion of the n-th stage (see below). A269964

a(n) = 24·n² + 52·n + 29. A258721

Expansion of 1/((1-x)(1-2x)(1-6x)(1-11x)). A21204

a(1)=1. a(n) = ∑_{1<=k<n, gcd(k,n(n+1))=1} a(k). A125596

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood. A271150

Irregular triangle read by rows: T(n,k) = number of size k subsets of S_n that remain unchanged by a rotation of 90 degrees. A277085

Let a₀ = 1 and for n > 0, let a_n be the smallest positive integer not already in the sequence such that (a₀ + a₁ x + a-2x² + ....)^1/3 has integer coefficients. (Hanna's A083349). Let f(n) = n th term in the present sequence. Then a₀ + a₁ x + a₂ x² + ... = (1-x)^f(1) (1-x²)^f(2) (1-x³)^f(3) .... A110879

Numbers k such that 413·2^k+1 is prime. A323106