Properties of the Number -6259

Two Hundred Fifty-Nine

Basics

Value: -6260 → -6259 → -6258

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 569

Divisors: 1, 11, 569, 6259

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1100001110011

Octal: -14163

Duodecimal: -3757

Hexadecimal: -1873

Square: 39175081

Square Root: 79.11384202527394

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

Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of e.g.f. 1/∏_{j > 0, j mod k > 0} exp(x^j). A293530

E.g.f.: 1/∏_{m > 0, m mod 3 > 0} exp(x^m). A293533

Number of partitions of n if there are two kinds of 1's and two kinds of 2's. A97

Generalized 29-gonal (or icosienneagonal) numbers: m*(27·m - 25)/2 with m = 0, +1, -1, +2, -2, +3, -3, ... A303815

29-gonal numbers: a(n) = n*(27·n-25)/2. A255187

Number of integer partitions of n with no adjacent parts of quotient 2. A350837

Number of partitions of n where the difference between consecutive parts is at most 4. A238864

Consecutive states of the linear congruential pseudo-random number generator (211·s + 1663) mod 7875 when started at s=1. A385002

Number of maximal subsets of {1..n} containing no differences or quotients of pairs of distinct elements. A326491

Expansion of g.f. 1/ (1-x¹*(1-x^m+1)/ (1-x²*(1-x^m+2)/ (1- ... ))) for m=9. A228645