Properties of the Number -8359

Three Hundred Fifty-Nine

Basics

Value: -8360 → -8359 → -8358

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 13 × 643

Divisors: 1, 13, 643, 8359

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10000010100111

Octal: -20247

Duodecimal: -4A07

Hexadecimal: -20a7

Square: 69872881

Square Root: 91.42756695876797

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

Consider the triangle in which the n-th row starts with n, contains n terms and the difference of successive terms is 1,2,3,... up to n-1. Sequence gives row sums. A81498

Coordination sequence for "ubt" 3D uniform tiling. A299291

Number of integer partitions of n where the parts do not have the same median as the distinct parts. A360244

Number of 2n-bead black-white reversible complementable necklaces with n black beads. A6840

Expansion of (-1 + ∏_k>=1 1 / (1 + (-x)^k))⁷. A341246

a(n) = PrimePi(n³) - PrimePi(n)³, where PrimePi = A000720. A291538

Integers y such that 11·x² - 9·y² = 2 for some integer x. A83043

Sum of first n Mersenne primes A000668. A153474

Expansion of (1+x+x²) / ((1-x)*(1-x-x²)). A154691

Number of partitions of n into an odd number of parts, the least being 4; also, a(n+4) = number of partitions of n into an even number of parts, each >=4. A27190