Properties of the Number 24045

Twenty-Four Thousand Forty-Five

Basics

Value: 24044 → 24045 → 24046

Parity: odd

Prime: No

Previous Prime: 24043

Next Prime: 24049

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 7 × 229

Divisors: 1, 3, 5, 7, 15, 21, 35, 105, 229, 687

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110111101101

Octal: 56755

Duodecimal: 11AB9

Hexadecimal: 5ded

Square: 578162025

Square Root: 155.06450270774417

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

Number of integer partitions of n that can be partitioned into distinct pairs of distinct parts, i.e., into a set of edges. A339560

a(n) = T(n,n-6), array T as in A055818. A55823

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same. A205909

Triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n edges and k vertices, n >= 0, 1 <= k <= n+1. A331437

Irregular triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n vertices and k edges, n >= 1, 0 <= k <= n*(n-1)/2. A331438

Number of (n+1)X3 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same. A205903

Number of (n+1)X4 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same. A205904

Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n. A228859

Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down. A253218

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