Properties of the Number -12268

Twelve Thousand Two Hundred Sixty-Eight

Basics

Value: -12269 → -12268 → -12267

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 3067

Divisors: 1, 2, 4, 3067, 6134, 12268

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111111101100

Octal: -27754

Duodecimal: -7124

Hexadecimal: -2fec

Square: 150503824

Square Root: 110.76100396800311

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 partitions of n into aliquant parts (i.e., parts that do not divide n). A98743

Total sum of the sums of all positive k-th ranks of all partitions of n. A208483

Excess of n + product of digits over next prime associated with A091628. A91632

Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x). A97155

G.f.: ∑_n>=0 (n+1) * xⁿ * (1 + xⁿ)ⁿ. A326002

Number of intersection points formed by drawing all least squares regression lines fitted to n points (j,y_j), 0 <= j < n, where each y_j is 0 or 1. A371437

Number of paraffins. A6001

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 72 ones. A31840

a(n) = ∑_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604. A47881

Number of ways the set {1,2,...,n} can be split into two subsets of which the sum of one is twice the sum of the other. A113035