Properties of the Number -29681

Twenty-Nine Thousand Six Hundred Eighty-One

Basics

Value: -29682 → -29681 → -29680

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 67 × 443

Divisors: 1, 67, 443, 29681

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111001111110001

Octal: -71761

Duodecimal: -15215

Hexadecimal: -73f1

Square: 880961761

Square Root: 172.28174598604463

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

a(n) = 4·a(n-1) - a(n-2), with a(0) = 1, a(1) = 1. A1835

a(n) = 4·a(n-2) - a(n-4) for n > 1, a(n) = n for n = 0, 1. A2530

a(n) = (1 + a(n-1)*a(n-2))/a(n-3), a(0) = a(1) = a(2) = 1. A5246

Array T(k,n) read by antidiagonals. G.f.: x(1-x)/(1-kx+x²), k>1. A94954

a(n) = 4·a(n-1) - a(n-2) with a(1) = 1, a(2) = 3. A79935

Square array T(M,N) read by antidiagonals: number of dimer tilings of a 2·M X 2·N Moebius strip. A103997

a(2n+1) = a(2n) + a(2n-1), a(2n) = 2·a(2n-1) + a(2n-2); a(n) = n for n = 0, 1. A48788

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = 2ⁿ * sqrt(Resultant(U_2·n(x/2), T_k(i·x/2))), where T_n(x) is a Chebyshev polynomial of the first kind, U_n(x) is a Chebyshev polynomial of the second kind and i = sqrt(-1). A334178

a(n) = C(2,n) δ C(0,n). A147721

a(n) = (1/2)*(n³ - 6·n² + 13·n - 6). A158498