Properties of the Number -6279

Two Hundred Seventy-Nine

Basics

Value: -6280 → -6279 → -6278

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 13 × 23

Divisors: 1, 3, 7, 13, 21, 23, 39, 69, 91, 161

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1100010000111

Octal: -14207

Duodecimal: -3773

Hexadecimal: -1887

Square: 39425841

Square Root: 79.24014134263012

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

E.g.f. A(x) satisfies A(x) = exp(x·A(x)/A(-x·A(x))³). A385060

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A385060. A385063

a(n) is the number of subsequences of [ 1, ..., 2n ] in which each odd number has an even neighbor. A7482

Second 9-gonal (or nonagonal) numbers: a(n) = n*(7·n+5)/2. A179986

Squarefree integers m > 1 such that if prime p divides m, then the sum of the base p digits of m is at least p. A324315

Numbers having exactly three prime gaps in their factorization. A73495

Number of multigraphs with 4 nodes and n edges. A3082

Number of integer partitions of n such that every orderless pair of distinct parts has a different sum. A325857

Squarefree odd numbers with exactly 4 distinct prime factors. A46390

Numbers n such that sopf(n) = sopf(n+1) - sopf(n-1), where sopf(x) = sum of the distinct prime factors of x. A76525