Properties of the Number 42144

Forty-Two Thousand One Hundred Forty-Four

Basics

Value: 42143 → 42144 → 42145

Parity: even

Prime: No

Previous Prime: 42139

Next Prime: 42157

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁵ × 3 × 439

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1010010010100000

Octal: 122240

Duodecimal: 20480

Hexadecimal: a4a0

Square: 1776116736

Square Root: 205.29003872570144

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

Triangle read by rows: T(n,m) (n >= m >= 1) = number of line segments formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares. A331454

a(0) = 0 by convention; for n>0, a(n) is the number of edges in the n-th figure shown in A255011 (meaning the figure with 4n points on the perimeter). A331448

Place n equally spaced points on each side of a square, and join each of these points by a chord to the 3·n new points on the other three sides: sequence gives number of regions in the resulting planar graph. A367278

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of edges in the resulting planar graph. A367324

3-loop graph coloring a rectangular array: number of n X 1 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223240

Numbers k such that Bernoulli number B_k has denominator 4501770. A295597

a(0)=1; a(1)=1; for n >= 2, a(n) = a(n-A000120(n)) + a(n-1-A023416(n)). A297216

Number of cells formed by connecting all the 4n points on the perimeter of an n X n square by straight lines; a(0) = 0 by convention. A255011

T(n,k)=3-loop graph coloring a rectangular array: number of nXk 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223247

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n·k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph. A367304