Properties of the Number 24032

Twenty-Four Thousand Thirty-Two

Basics

Value: 24031 → 24032 → 24033

Parity: even

Prime: No

Previous Prime: 24029

Next Prime: 24043

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ⁵ × 751

Divisors: 1, 2, 4, 8, 16, 32, 751, 1502, 3004, 6008

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110111100000

Octal: 56740

Duodecimal: 11AA8

Hexadecimal: 5de0

Square: 577537024

Square Root: 155.0225790006088

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

Triangular array generated by its row sums: T(n,0) = 1 for n >= 0, T(n,1) = r(n-1), T(n,k) = T(n,k-1) - (-1)^k * r(n-k) for k = 2, 3, ..., n, n >= 2, r(h) = sum of the numbers in row h of T. A54090

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 3,2,0,1,4 for x=0,1,2,3,4. A196590

Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {|p(i)-i|, i=1,2,...,n} has exactly k elements (1<=k<=n). A125183

Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle in which the root (a distinguished node) has degree k (n >= 2, 1 <= k <= n-1). A143022

a(0) = 1; thereafter a(n) = 2*(6·n² - 3·n + 1). A386477

Triangle read by rows: coefficients of a Bessel polynomial recursion: P(x, n) = 2*(n-1)*P(x, n - 1)/x - n·P(x, n - 2) with substitution x -> 1/y. A136668

Number of n X 3 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 3,2,0,1,4 for x=0,1,2,3,4. A196585

Number of nX6 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 3,2,0,1,4 for x=0,1,2,3,4. A196588

Number of n X 3 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing. A224141

Number of length n+3 0..7 arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms. A249706