Properties of the Number -14864

Fourteen Thousand Eight Hundred Sixty-Four

Basics

Value: -14865 → -14864 → -14863

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 929

Divisors: 1, 2, 4, 8, 16, 929, 1858, 3716, 7432, 14864

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11101000010000

Octal: -35020

Duodecimal: -8728

Hexadecimal: -3a10

Square: 220938496

Square Root: 121.91800523302537

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

Largest finite number of distinct words arising in Watanabe's tag system {00, 1011} applied to a binary word w, over all starting words w of length n. A291067

Array read by antidiagonals: T(m,n) is the number of induced paths in the grid graph P_m X P_n. A360199

Positions of zeros in A345055, which is the Dirichlet inverse of A011772. A345053

Number of induced paths in the n X n grid graph. A360200

a(n) = n*(29·n + 1)/2. A22287

Number of derangements up to cyclic rotations; permutation siteswap necklaces, with no fixed points (no "zero-throws", i.e., empty hands, if we use the mapping Perm2SiteSwap1 of A060495 and A060498). A64636

a(n) = 512n + 16. A157475

G.f.: exp( ∑_n>=1 4^A001511(n) * xⁿ/n ), where 2^A001511(n) is the highest power of 2 that divides 2·n. A217553

Number of cyclic permutations of length n that avoid the pattern 132 (equivalently, 213). A309505

Number of Lyndon compositions of n where every pair of adjacent parts (including the last with the first) is relatively prime. A328669