Properties of the Number -16464

Sixteen Thousand Four Hundred Sixty-Four

Basics

Value: -16465 → -16464 → -16463

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁴ × 3 × 7 ³

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000001010000

Octal: -40120

Duodecimal: -9640

Hexadecimal: -4050

Square: 271063296

Square Root: 128.31211945876353

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.: ∑_n>=0 xⁿ * (xⁿ + i)ⁿ / (1 + i·xⁿ⁺¹)ⁿ⁺¹, where i² = -1. A323675

Expansion of (1-x)^-1/(1+2·x-x²+x³). A77922

a(n) = ∑_{k=0..floor(n/2)} (-n)^k * Stirling1(n,2·k). A357721

Number of 2n-step 2-dimensional closed self-avoiding paths on square lattice. A10566

Numbers k such that σ (x) = k has exactly 12 solutions. A60676

Numbers k > 1 such that, in base 8, k and k² contain the same digits in the same proportion. A61662

3 times 13-gonal (or tridecagonal) numbers: a(n) = 3·n*(11·n - 9)/2. A153875

a(n) = prime(n)⁵ - prime(n)³. A138406

Number of elements of GF(7ⁿ) with trace 0 and subtrace 3. A74016

T(n,k) = Number of n-step self-avoiding walks on a k X k X k X k 4-cube summed over all starting positions. A188784