Properties of the Number 71944

Seventy-One Thousand Nine Hundred Forty-Four

Basics

Value: 71943 → 71944 → 71945

Parity: even

Prime: No

Previous Prime: 71941

Next Prime: 71947

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 17 × 23 ²

Divisors: 1, 2, 4, 8, 17, 23, 34, 46, 68, 92

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10001100100001000

Octal: 214410

Duodecimal: 35774

Hexadecimal: 11908

Square: 5175939136

Square Root: 268.2237871628838

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 X k 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero. A231080

Number of non-isomorphic aperiodic multiset partitions of weight n with no singletons. A320812

a(n) = n²*(n² + 15)/4. A159833

Number of n X 4 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero. A231077

Number of 5 X n 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero. A231084

a(n) = 34·n². A303302

Number of α-labeled graphs with n edges and at most n vertices. A245519

Triangle read by rows giving numbers of paths in a lattice satisfying certain conditions. A71944

Row square-sums of triangle A185384. A208588

Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from the 4 vertices and the equally spaced 4·n points placed on the sides of a square when every pair of the 4 + 4·n points are connected by a circle and where the points lie at the ends of the circle's diameter. A373109