Properties of the Number -29467

Twenty-Nine Thousand Four Hundred Sixty-Seven

Basics

Value: -29468 → -29467 → -29466

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 79 × 373

Divisors: 1, 79, 373, 29467

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111001100011011

Octal: -71433

Duodecimal: -15077

Hexadecimal: -731b

Square: 868304089

Square Root: 171.65954677791737

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)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nXk array. A220328

Array T(n,m) read by antidiagonals: In an n X m grid draw straight walls between cells, starting at a border, such that the resulting figure is connected and has only one-cell wide paths; T(n,m) is the number of solutions up to symmetries of the rectangle. A375861

Number of compositions (ordered partitions) of n into distinct parts having a common factor > 1 with n. A332003

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 49 ones. A31817

Number of 5-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions. A187379

Equals two maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 3Xn array. A220330

a(n) = [ 1/(2·t(n+1) - t(n) - t(n+2)) ], where t(n) = tan(π/2 - 1/n) satisfies n-1 < t(n) < n for all n >= 1. A24817

Equals two maps: number of nX6 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nX6 array. A220327

Number of partitions p of n such that #m(1) = #m(2), where #m(i) = number of numbers in p that have multiplicity i. A241518