Properties of the Number -67820

Sixty-Seven Thousand Eight Hundred Twenty

Basics

Value: -67821 → -67820 → -67819

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 × 3391

Divisors: 1, 2, 4, 5, 10, 20, 3391, 6782, 13564, 16955

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10000100011101100

Octal: -204354

Duodecimal: -332B8

Hexadecimal: -108ec

Square: 4599552400

Square Root: 260.4227332626704

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

Sum T(n,k) of the k-th entries in all blocks of all set partitions of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A285595

Number of n-step three-sided prudent self-avoiding walks. A191823

a(n) = (2·n³ + 5·n² - 9·n)/2. A162258

Triangle read by rows: T(n,k) is the number of L-convex polyominoes of semiperimeter n, having k maximal rectangles (n >= 2, 1 <= k <= floor(n/2)). An L-convex polyomino is a convex polyomino in which any two cells can be connected by a path internal to the polyomino and which has at most 1 change of direction (i.e., one of the four orientations of the letter L). A maximal rectangle in an L-convex polyomino P is a rectangle included in P that is maximal with respect to inclusion. A181368

Triangle read by rows: T(n,k) is the number of 4-dimensional balanced ballot paths of 4n steps such that the height is exactly k, 3 <= k <= 3·n. A387987