Properties of the Number -283440

Two Hundred Eighty-Three Thousand Four Hundred Forty

Basics

Value: -283441 → -283440 → -283439

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁴ × 3 × 5 × 1181

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000101001100110000

Octal: -1051460

Duodecimal: -118040

Hexadecimal: -45330

Square: 80338233600

Square Root: 532.3908338805243

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 / (∑_n=-oo..oo x^n²)³. A4404

Number of binary sequences of length n with no initial repeats (or, with no final repeats). A122536

Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^n-1 starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words·and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k = 1. A93371

Expansion of 1/theta₄(q)³ in powers of q = exp(π i t). A319552

Number of binary sequences of length 2n and curling number 1. A211966