Properties of the Number 24308

Twenty-Four Thousand Three Hundred Eight

Basics

Value: 24307 → 24308 → 24309

Parity: even

Prime: No

Previous Prime: 24281

Next Prime: 24317

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 59 × 103

Divisors: 1, 2, 4, 59, 103, 118, 206, 236, 412, 6077

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101111011110100

Octal: 57364

Duodecimal: 12098

Hexadecimal: 5ef4

Square: 590878864

Square Root: 155.91023058157538

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 length (n+k)X1 arrays of occupancy after each element moves up to +-k places including 0. A222345

Number of n X 8 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order. A166813

a(n) = ∑_i=1..n σ(i)*σ(i+1), where σ(n) = A000203(n) is the sum of the divisors of n. A330322

Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UUDDUDUUUUDUDDDDUUDD (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-2)/8)), read by rows. A242450

Number of dihedral Carlitz compositions of n. A292906

Partial sums of A006950. A233969

Number of sets of nonzero triangular numbers whose largest element is the n-th triangular number and whose sum is a triangular number. A378961

Number of asymmetric (identity) trees with n nodes and 8 leaves. A55339

Expansion of g.f. x*(1 +30·x +49·x² -71·x³ -116·x⁴)/((1+2·x)*(1-2·x²) *(1-2·x-4·x²)). A121960

a(n) = binomial(n, [n/2]) - 2. A201686