Properties of the Number -30961

Thirty Thousand Nine Hundred Sixty-One

Basics

Value: -30962 → -30961 → -30960

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 × 4423

Divisors: 1, 7, 4423, 30961

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111100011110001

Octal: -74361

Duodecimal: -15B01

Hexadecimal: -78f1

Square: 958583521

Square Root: 175.95738120351757

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

Number of regions in a polygon whose boundary consists of n+2 equally spaced points around a semicircle and three equally spaced points along the diameter (a total of n+3 points). See Comments for precise definition. A333642

Fourth row of Pascal-(1,5,1) array A081580. A81590

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 100 ones. A31868

Number of nX1 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to one or two horizontal or vertical neighbors. A199358

a(n) is the smallest number that belongs simultaneously to the two arithmetic progressions prime(n) + m·prime(n+1) and prime(n+1) + m·prime(n+2), m >= 1, n >= 1. A319524

Number of partitions satisfying cn(1,5) < cn(2,5) + cn(3,5) and cn(4,5) < cn(2,5) + cn(3,5). A39888

Index k of the first occurrence of A019565(2n-1) as the smallest term that makes prime(k)-A019565(2n-1) prime. A103792