Properties of the Number -4268

Two Hundred Sixty-Eight

Basics

Value: -4269 → -4268 → -4267

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 11 × 97

Divisors: 1, 2, 4, 11, 22, 44, 97, 194, 388, 1067

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000010101100

Octal: -10254

Duodecimal: -2578

Hexadecimal: -10ac

Square: 18215824

Square Root: 65.3299318842443

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

G.f. A(x) satisfies: A(x)⁴ = (1-x) * (A(x) + x)³. A352413

Number of integer partitions of n whose length (number of parts) is not equal to the sum of any submultiset. A367213

Starts of runs of 3 consecutive positive negaFibonacci-Niven numbers (A331085). A331087

Number of integer partitions of n such that every pair of distinct parts has a different quotient. A325853

Numbers of the form 9·m² + 4·m, m an integer. A185039

T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A234882

Smallest value of·such that x² + y² = P, where P is the product of the first n primes of the form 4k + 1, and 0 < x < y. A236381

Numbers that are the sum of six cubes in exactly ten ways. A345772

a(n) = ∑_i=1..n (A077068(i) - A077065(i)). A232221

Asymptotic phase shift of the tetration base n written by juxtaposing its representative congruence classes modulo 10 (i.e., the 1, 2, or 4, distinct sfasamenti taken by starting from the minimum height such that the congruence speed of n is constant), and a(n) = -1 if n is a multiple of 10. A376842