Properties of the Number -34660

Thirty-Four Thousand Six Hundred Sixty

Basics

Value: -34661 → -34660 → -34659

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 5 × 1733

Divisors: 1, 2, 4, 5, 10, 20, 1733, 3466, 6932, 8665

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000011101100100

Octal: -103544

Duodecimal: -18084

Hexadecimal: -8764

Square: 1201315600

Square Root: 186.17196351760379

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

Coefficients in the expansion of 1/([r] + [2r]x + [3r]x² + ...); [ ] = floor, r = e/2. A279591

Number T(n,k) of defective parking functions of length n and defect k; triangle T(n,k), n>=0, 0<=k<=max(0,n-1), read by rows. A264902

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw. A253326

Number of partitions of n in which the number of prime parts is not equal to the number of nonprime parts. A355306

Number of defective parking functions of length n and defect six. A291132

Number of (n+1)X(4+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw. A253322

Number of (6+1)X(n+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw. A253331

a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3. A22869

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), ...). A24481

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), F(4), ...). A25101