Properties of the Number -134432

One Hundred Thirty-Four Thousand Four Hundred Thirty-Two

Basics

Value: -134433 → -134432 → -134431

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁵ × 4201

Divisors: 1, 2, 4, 8, 16, 32, 4201, 8402, 16804, 33608

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -100000110100100000

Octal: -406440

Duodecimal: -65968

Hexadecimal: -20d20

Square: 18071962624

Square Root: 366.6496965769916

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)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 or -1,-2. A264285

Column 0 of triangle A141760. A141761

Triangle T, read by rows, where the g.f. of column k in matrix power T^m is given by: 1/(1-x)^m = ∑_n>=k [T^m](n,k) * x^n-k/(1+x)^{n(n-1)/2 - k(k-1)/2} for k>=0. A141760

Number of (n+1)X(7+1) arrays of permutations of 0..n·8+7 with each element having directed index change 0,0 0,1 1,0 or -1,-2. A264284

Number of (3+1)X(n+1) arrays of permutations of 0..n·4+3 with each element having directed index change 0,0 0,1 1,0 or -1,-2. A264287

The maximum number of minimal dominating sets in a tree with n vertices. A306692