Properties of the Number -8047

Forty-Seven

Basics

Value: -8048 → -8047 → -8046

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 × 619

Divisors: 1, 13, 619, 8047

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111101101111

Octal: -17557

Duodecimal: -47A7

Hexadecimal: -1f6f

Square: 64754209

Square Root: 89.70507232035433

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 n-node unlabeled graphs without endpoints (i.e., no nodes of degree 1). A4110

Smallest composite that when added to sum of prime factors reaches a prime after n iterations. A50710

Number of partitions of n which represent first player winning Chomp positions. A112471

Table in which the g.f. of row n, R(n,x), satisfies ∑_k=-oo..+oo (-1)^k * (x^k + n·R(n,x))^k = 1 + (n+2)*∑_k>=1 (-1)^k * x^k², for n >= 1, as read by antidiagonals. A370020

Expansion of g.f. A(x) satisfying ∑_n=-oo..+oo (-1)ⁿ * (xⁿ + A(x))ⁿ = 1 + 3*∑_n>=1 (-1)ⁿ * x^n². A370021

a(n) = maximum(continuedfraction(F(n+1)ⁿ/F(n)ⁿ)) - L(n) + (1-(-1)ⁿ)/2, where F(n) is Fibonacci(n) and L(n) is the n-th Lucas number. A213358

Numbers k with the property that it is possible to write the base 2 expansion of k as concat(a₂,b₂), with a₂>0 and b₂>0 such that, converting a₂ and b₂ to base 10 as a and b, we have σ(a + b) = σ(k). A258843

Triangle read by rows where T(n,k) is the number of unlabeled simple graphs with n vertices and exactly k endpoints (vertices of degree 1). A327371

T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero. A298508

Place n points on each of the three sides of a triangle, 3n points in all; a(n) = number of nondegenerate triangles that can be constructed using these points (plus the 3 original vertices) as vertices. A130748