Properties of the Number -67354

Sixty-Seven Thousand Three Hundred Fifty-Four

Basics

Value: -67355 → -67354 → -67353

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 × 17 × 283

Divisors: 1, 2, 7, 14, 17, 34, 119, 238, 283, 566

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -10000011100011010

Octal: -203432

Duodecimal: -32B8A

Hexadecimal: -1071a

Square: 4536561316

Square Root: 259.5264919040058

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) 0..3 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..3 introduced in row major order. A231451

Number A(n,k) of length-n restricted growth strings (RGS) with growth <= k and first element in [k]; square array A(n,k), n>=0, k>=0, read by antidiagonals. A306024

Number of n X 1 0..3 arrays with values 0..3 introduced in row major order and each element equal to one or two horizontal and vertical neighbors. A199142

Number of length-n restricted growth strings (RGS) with growth <= n and first element in [n]. A306025

Number of length-n restricted growth strings (RGS) with growth <= five and first element in [5]. A306029

Number of (n+1) X (1+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..3 introduced in row major order. A231444