Properties of the Number 24818

Twenty-Four Thousand Eight Hundred Eighteen

Basics

Value: 24817 → 24818 → 24819

Parity: even

Prime: No

Previous Prime: 24809

Next Prime: 24821

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 12409

Divisors: 1, 2, 12409, 24818

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110000011110010

Octal: 60362

Duodecimal: 12442

Hexadecimal: 60f2

Square: 615933124

Square Root: 157.53729717117784

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

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with the (lower) medians of each row unequal to its neighbors and each column equal to its neighbors. A238026

a(n) = ∑_{i+j+k=n, i,j,k >= 1} τ(i)*τ(j)*τ(k), where τ() = A000005(). A191829

Antidiagonal sums of the convolution array A213573. A213575

Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), n>=0, ceiling((sqrt(1+8·n)-1)/2)<=k<=n, read by rows. A316292

Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns. A316293

G.f. A(x) = lim_n->infinity (1 - P(n,x))/(-2·x)ⁿ, where P(1,x) = 1/sqrt(1 - 4·x), and P(n+1,x) = 1/sqrt(1 - 4·x + 4·x*P(n,x)) for n >= 1. A351510

Numbers k such that w(k), w(k+1), and w(k+2) are all odd, where w is A360519. A361106

Number of (n+2)X(1+2) 0..1 arrays with the (lower) medians of each row unequal to its neighbors and each column equal to its neighbors. A238021

Number of n X n 0..6 matrices with each 2X2 subblock idempotent. A224663

a(n) = floor(tan m), where m is the least positive integer such that floor(tan m) > floor(tan k) for k = 0,1,...,m-1. A24818