Properties of the Number -18964

Eighteen Thousand Nine Hundred Sixty-Four

Basics

Value: -18965 → -18964 → -18963

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 11 × 431

Divisors: 1, 2, 4, 11, 22, 44, 431, 862, 1724, 4741

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100101000010100

Octal: -45024

Duodecimal: -AB84

Hexadecimal: -4a14

Square: 359633296

Square Root: 137.70983988081608

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

Centered 21-gonal numbers. A69178

Number of Dyck paths such that the sum of the peak-abscissae is n. A129528

G.f. satisfies: A(x,y) = 1 + x·y*A(x,y+1)². A268652

Least m such that if r and s in {1/1, 1/3, 1/6,..., 1/C(n+1,2)} satisfy r < s, then r < k/m < s for some integer k. A24826

Those terms of A255571 whose every A080541/A080542-rotation is also a term of A255571. A258001

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n)², where a(0) = 2, a(1) = 4, b(0) = 1, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296249

Number of 6-ary rooted trees with n nodes and height at most 4. A36621

The (7ⁿ)-th composite number. A65606

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 0), (1, -1, 0), (1, 0, 0), (1, 1, -1)}. A148741