Properties of the Number -3107

One Hundred Seven

Basics

Value: -3108 → -3107 → -3106

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 13 × 239

Divisors: 1, 13, 239, 3107

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -110000100011

Octal: -6043

Duodecimal: -196B

Hexadecimal: -c23

Square: 9653449

Square Root: 55.74047003748713

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

Numerator of the n-th term in the first differences of the binomial transform of the "original" Bernoulli numbers. A165161

Number of integer partitions of n whose product is a perfect power. A320322

a(1)=1, a(n)=a(n-1)+n if n even, a(n)=a(n-1)+n² if n is odd. A136047

Take an n X n square grid of points in the plane; a(n) = number of ways to divide the points into two sets using a straight line. A114043

Expansion of (1-x+x²)/((1-x)²*(1-x²)*(1-x⁴)). A5232

Composite and every divisor (except 1) contains the digit 3. A62668

Sum of fourth powers of three consecutive primes. A133531

Partial sums of ceiling(n²/2) (A000982). A131941

Number of ways to split a strict integer partition of n into consecutive subsequences with equal sums. A318683

Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from upper left corner to lower right corner, and no 1 having more than two 1's adjacent. A391818