Properties of the Number -157184

One Hundred Fifty-Seven Thousand One Hundred Eighty-Four

Basics

Value: -157185 → -157184 → -157183

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ⁹ × 307

Divisors: 1, 2, 4, 8, 16, 32, 64, 128, 256, 307

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -100110011000000000

Octal: -463000

Duodecimal: -76B68

Hexadecimal: -26600

Square: 24706809856

Square Root: 396.4643741876437

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

a(n) = 2 * ∑_k=0..n-1 binomial(n-1, k)*binomial(n+k, k). A2003

Row sums of A123160. A123164

Coordination sequence for C₈ lattice. A19564

Coordination sequence for 8-dimensional cubic lattice. A8416

Number of points of L1 norm 8 in cubic lattice Zⁿ. A35602

Number of symmetric Schroeder paths of length 2n (A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis). A110110

Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n that start with exactly k (0,1) steps (or, equivalently, with exactly k (1,0) steps). A110171

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) is the coefficient of x^k·n in expansion of ( (1 + x)/(1 - x) )ⁿ. A336521

Convolution of A055853 with A011782. A55854

a(n) = 2·a(n-2) + 4·a(n-3), with initial terms 0, 1, 1. A134136