Properties of the Number -14329

Fourteen Thousand Three Hundred Twenty-Nine

Basics

Value: -14330 → -14329 → -14328

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 × 23 × 89

Divisors: 1, 7, 23, 89, 161, 623, 2047, 14329

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11011111111001

Octal: -33771

Duodecimal: -8361

Hexadecimal: -37f9

Square: 205320241

Square Root: 119.70380110923796

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

The non-repetitive Kaprekar binary numbers in decimal. A163205

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 2,-2 -1,0 -1,2 1,0 or 0,-1. A264379

a(n) = C(n-1,1) + C(n-3,3) + ... + C(n-2·m-1,2·m+1), where m = floor((n-2)/4). A24490

a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes. A66509

a(n) = ceiling(Fibonacci(n)/2). A173173

Expansion of (1+x)/((1+x+x²)(1-x-x²)). A93040

Row sums of triangle A099510, so that a(n) = ∑_k=0..n coefficient of z^k in (1 + 2·z + z²)^n-[k/2], where [k/2] is the integer floor of k/2. A99511

Number of narrowly recursively normal integer partitions of n. A332272

a(n) = floor[(φ + n mod 2)*a(n-1)], a(1)=1. A107857

Expansion of (1-x)³/(1-4x+5x²-4x³+x⁴). A109961