Properties of the Number -4367

Three Hundred Sixty-Seven

Basics

Value: -4368 → -4367 → -4366

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 11 × 397

Divisors: 1, 11, 397, 4367

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000100001111

Octal: -10417

Duodecimal: -263B

Hexadecimal: -110f

Square: 19070689

Square Root: 66.08328079022712

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

Expansion of (1 - 2·x²)/(1 + x)⁴. Third column of Riordan triangle A248156. A248159

First term of n-th difference sequence of (floor(k·r)), r = sqrt(8), k >= 0. A325674

Expansion of (1-x)^-1/(1+x²-x³). A77888

Number of partitions of n into Fibonacci parts (with a single type of 1). A3107

Number of subsets of {1..n} (including empty set) such that the pairwise sums of distinct elements are all distinct. A196723

Numbers whose binary expansion generates rotationally symmetric XOR-triangles. A334556

a(n) = least k such that the remainder when 28^k is divided by k is n. A128368

Number of integer partitions of n > 0 where the minimum part equals the number of parts minus the number of distinct parts. A324520

G.f. satisfies A(x) = (1 + x·A(x)²)*(1 + x²*A(x)³). A200075

T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without 2-loops. A221114