Properties of the Number -132861

One Hundred Thirty-Two Thousand Eight Hundred Sixty-One

Basics

Value: -132862 → -132861 → -132860

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 67 × 661

Divisors: 1, 3, 67, 201, 661, 1983, 44287, 132861

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000011011111101

Octal: -403375

Duodecimal: -64A79

Hexadecimal: -206fd

Square: 17652045321

Square Root: 364.5010288051325

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

Numbers k such that 4·k + 3 is a perfect cube, sorted by absolute values. A305291

Number of closed walks of length n along the edges of a tetrahedron based at a vertex. A54878

a(n) = (2 + (-1)ⁿ + 3ⁿ)/4. A122983

Closed walks of length 2n along the edges of a cube based at a vertex. A54879

Binomial transform of (1,-1,4,-16,64,-256,1024,...) = (3·0ⁿ-(-4)ⁿ)/4. A84567

Numbers occurring in A137822 : first differences of numbers n such that 3 | sum( Catalan(k), k=1..2n). A137823

Array read by antidiagonals: A(n, L) is the number of closed walks of length 2L along the edges of an n-cube based at a vertex, for n >= 1 and L >= 1. A286899

A(n, k) = (m·k)! [x^k] MittagLefflerE(m, x)ⁿ, for m = 2, n >= 0, k >= 0; square array read by descending antidiagonals. A326476

a(n) = ceiling(n⁴/4). A131478

a(n) = 3·a(n-1) - a(n-3) + 3·a(n-4), starting with 1, 2, 6, 20. A132353