Properties of the Number -4251

Two Hundred Fifty-One

Basics

Value: -4252 → -4251 → -4250

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 13 × 109

Divisors: 1, 3, 13, 39, 109, 327, 1417, 4251

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000010011011

Octal: -10233

Duodecimal: -2563

Hexadecimal: -109b

Square: 18071001

Square Root: 65.19969325081216

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

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 313", based on the 5-celled von Neumann neighborhood. A271203

Square array, read by antidiagonals, where row n equals the crystal ball sequence for the A_n lattice. A108625

Generalized 15-gonal (or pentadecagonal) numbers: n*(13·n - 11)/2, n = 0,+1,-1,+2,-2,+3,-3, ... A277082

a(n) is the solution to the postage stamp problem with n denominations and 4 stamps. A1214

Number of integer partitions of n with one fewer distinct multiplicities than distinct parts. A325244

15-gonal (or pentadecagonal) numbers: n*(13n-11)/2. A51867

Number of integer partitions of n having no permutation with all equal run-lengths. A382915

Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n. A84268

Number of 9's in all partitions of n. A24793

Number of partitions of n into 9 squarefree parts. A326522