Properties of the Number -14602

Fourteen Thousand Six Hundred Two

Basics

Value: -14603 → -14602 → -14601

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 7 ² × 149

Divisors: 1, 2, 7, 14, 49, 98, 149, 298, 1043, 2086

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11100100001010

Octal: -34412

Duodecimal: -854A

Hexadecimal: -390a

Square: 213218404

Square Root: 120.83873551142449

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 step shifted (decimated) sequence structures using a maximum of two different symbols. A56391

Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n. A31

Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal binary arrays (n >= 1, k >= 1). A184271

Number of nonisomorphic circulant graphs, i.e., undirected Cayley graphs for the cyclic group of order n. A49287

Number of nonisomorphic circulant digraphs (i.e., Cayley digraphs for the cyclic group) of order n. A49297

Number of vertex-transitive graphs with n nodes. A6799

Number of Cayley graphs on n nodes. A185959

Number of circulant graphs on n vertices up to Cayley isomorphism. A285620

Number of necklaces with n beads of 3 colors, no 2 adjacent beads the same color. A106365

Triangle read by rows: T(n,k) is the number of partitions of a 3-colored set of n objects into at most k parts with 0 <= k <= n. A382045