Properties of the Number -16951

Sixteen Thousand Nine Hundred Fifty-One

Basics

Value: -16952 → -16951 → -16950

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 23 × 67

Divisors: 1, 11, 23, 67, 253, 737, 1541, 16951

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100001000110111

Octal: -41067

Duodecimal: -9987

Hexadecimal: -4237

Square: 287336401

Square Root: 130.19600608313604

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) = -a(n-1) - 3·a(n-2) with n>1, a(0)=0, a(1)=1. A214733

Number of arrangements of n circles in the affine plane. A250001

Expansion of 1/(1-x*(1-3·x)). A106852

Expansion of x/((1-x-x³)*(1-x)⁴). A144898

Expansion of ∑_k>0 x^3·k/(1-x^k)⁴. A363607

a(n) = 5·a(n-1) - 9·a(n-2), with a(0)=0, a(1)=1. A190970

a(0)=1, a(1)=1, a(n) = 11·a(n/2) for even n, and a(n) = 10·a((n-1)/2) + a((n+1)/2) for odd n >= 3. A116525

a(n) = (n-1)*(n-2)*(n²+9·n+12)/24. A323847

a(n) = binomial(n+5,5) + 4·binomial(n+4,5) + 4·binomial(n+3,5) + binomial(n+2,5). A244864

As a binary numeral, the bit 2^m-1 of a(n) is 1 iff m is a proper divisor of n. A247146