Properties of the Number -17443

Seventeen Thousand Four Hundred Forty-Three

Basics

Value: -17444 → -17443 → -17442

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 17443

Divisors: 1, 17443

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100010000100011

Octal: -42043

Duodecimal: -A117

Hexadecimal: -4423

Square: 304258249

Square Root: 132.07195008782145

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

Expansion of 1/(1 - ∑_k>=1 q(k)*x^k), where q(k) = number of partitions of k into distinct parts (A000009). A304969

T(n,k)=Number of (n·k)Xk binary arrays with rows in nonincreasing order, n ones in every column and no more than 3 ones in any row. A188416

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change -1,-1 1,0 -1,-2 -2,-2 or 0,1. A264676

a(n) = 15n² + 3n + 1. A165806

Smallest balanced prime of order n. A82080

The 240-degree spoke (or ray) of a hexagonal spiral of Ulam. A244805

Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p={p₁, p₂, p₃, p₄} = {-3,0,1,2}, n=3·r+p_i, and define a(-3)=0. Then a(n)=a(3·r+p_i) gives the quantity of H_9,4,0 tiles in a subdivided H_9,i,r tile after linear scaling by the factor Q^r, where Q=sqrt(2·cos(π/9)). A187498

T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero. A298461

Place n equally spaced points on the circumference of a circle of radius r and then connect each pair of points with straight lines whose intersections create A007569(n) - n additional points. Draw a circle of radius r around each of the A007569(n) points. The sequence gives the total number of vertices formed from all circle intersections. A374825

Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 3, s(2n+1) = 4. A94832