Properties of the Number -6231

Two Hundred Thirty-One

Basics

Value: -6232 → -6231 → -6230

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 31 × 67

Divisors: 1, 3, 31, 67, 93, 201, 2077, 6231

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1100001010111

Octal: -14127

Duodecimal: -3733

Hexadecimal: -1857

Square: 38825361

Square Root: 78.93668348746354

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

a(n) = (2·n-1)*(5·n²-5·n+6)/6. A63489

Numbers which yield a prime whenever a 1 is inserted anywhere in them (including at the beginning or end). A68679

Total number of largest parts in all partitions of n into odd parts. A92311

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7. A252407

Number of partitions of n such that every part divides the largest part and such that the smallest part divides every part. A130714

Starting from generation 8 add previous and next term yielding generation 9. A48455

Lower triangular matrix T, read by rows, such that row (n) is formed from the sums of adjacent terms in row (n-1) of the matrix square T², with T(0,0)=1. A97710

a(1) = 8; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A74344

Numbers n whose square can be represented as a repdigit number in some base less than n. A158235