Properties of the Number -15951

Fifteen Thousand Nine Hundred Fifty-One

Basics

Value: -15952 → -15951 → -15950

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: Yes

Factorization: 3 × 13 × 409

Divisors: 1, 3, 13, 39, 409, 1227, 5317, 15951

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11111001001111

Octal: -37117

Duodecimal: -9293

Hexadecimal: -3e4f

Square: 254434401

Square Root: 126.29726837901127

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 triangle of coefficients of polynomials with roots as the π-digits base ten A000796(n)=d(n):d(1)=3; p(x,n)=-d(1)*Product[x-d(m),{m,2,n}]. A152575

Palindromic in bases 10 and 32. A99165

Palindromic in bases 10 and 27. A250411

Consider all (2n+1)-digit palindromic primes of the form 10...0M0...01 (so that M is a palindrome with <= 2n-1 digits); a(n) = smallest such M. A100026

Triangle, read by rows, equal to the matrix cube of triangle A185620. A185628

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) = ∑_{k=0..floor(n/3)} n^k * binomial(n-2·k,k). A368891

Subdiagonal of array of n-gonal numbers A081422. A81423

L.g.f.: ∑_n>=1 x^(2·n-1²) / ( (2·n-1) * (1 - x^2·n)^2·n-1 ). A293598

a(n) = 507·2ⁿ - 273. A304615