Properties of the Number -171360

One Hundred Seventy-One Thousand Three Hundred Sixty

Basics

Value: -171361 → -171360 → -171359

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ² × 5 × 7 × 17

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101001110101100000

Octal: -516540

Duodecimal: -83200

Hexadecimal: -29d60

Square: 29364249600

Square Root: 413.95651945584814

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

Triangle T(n,k): the coefficient [x^n-k] of the polynomial 2ⁿ*n!*L(n,3/2,x), where L is the generalized Laguerre Polynomial in the Abramowitz-Stegun normalization. A229789

Numbers k such that σ(k) > 4·k. A68404

Numbers k such that σ(k) >= 4·k. A23198

Numbers n whose divisors can be partitioned into four disjoint sets whose sums are all σ(n)/4. A204831

Number of symmetric ways to lace a shoe that has n pairs of eyelets such that each eyelet has at least one direct connection to the opposite side. A78700

a(n) = 3*(3·n+2)!/(2·n+3)!. A370055

Numbers k such that A380845(k) = 3·k. A380847

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0. A267901

a(1)=1; a(n) = n!*Fibonacci(n+2), n > 1. A5922

Numbers with abundancy 4 <= σ(n)/n < 5. A230608