Properties of the Number -17181

Seventeen Thousand One Hundred Eighty-One

Basics

Value: -17182 → -17181 → -17180

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 23 × 83

Divisors: 1, 3, 9, 23, 69, 83, 207, 249, 747, 1909

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100001100011101

Octal: -41435

Duodecimal: -9B39

Hexadecimal: -431d

Square: 295186761

Square Root: 131.07631364972087

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

G.f.: 1 / (1 + x + ∑_k>=2 prime(k-1) * x^k). A346792

Number of compositions of n with equal differences up to sign. A325557

Number of distinct circles that can be constructed from an n·n square grid of points using only a compass. A359931

a(n) is the ratio of the sum of the bends (curvatures) of the circles in the n-th generation of an Apollonian packing to the sum of the bends in the initial four-circle configuration. A135849

Sum of cubes of trinomial coefficients: a(n) = ∑_k=0..2n trinomial(n,k)³ where trinomial(n,k) = [x^k] (1 + x + x²)ⁿ. A132303

Put the natural numbers together without spaces and read them five at a time advancing one space each time. A193493

T(n,k)=Number of nXk arrays of permutations of 0..n·k-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 7. A264831

Numbers n such that n and prime(n) end with the same three digits. A67841

Sum of parts, counted without multiplicities, in all partitions of n into odd parts. A116930

Least multiple of 2n-1 ending in prime(n), 0 if no such number exists. A114780