Properties of the Number -6062

Sixty-Two

Basics

Value: -6063 → -6062 → -6061

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 433

Divisors: 1, 2, 7, 14, 433, 866, 3031, 6062

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1011110101110

Octal: -13656

Duodecimal: -3612

Hexadecimal: -17ae

Square: 36747844

Square Root: 77.85884663928692

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

Matrix inverse of A100862. A107102

Expansion of ∏_m>=1 (1 - m·q^m)⁷. A22667

Preperiod (or threshold) of orbit of Post's {00, 1101} tag system applied to the word (100)ⁿ, or -1 if this word has an unbounded trajectory. A284119

G.f. A(x) satisfies A(x) = (1 + x·A(x))*(1 + x³*A(x)³). A198951

Number of labeled connected digraphs on n nodes where every node has indegree 0 or outdegree 0 and no isolated nodes. A2031

The array in A059219 read by antidiagonals in 'up' direction. A59220

Sphenic numbers (A007304) whose neighbors are sphenic. A248202

Array read by antidiagonals: T(n,k) is the number of connected graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color. A322279

Number of connected graphs on n labeled nodes, each node being colored with one of 2 colors, such that no edge joins nodes of the same color. A2027

Expansion of (1/x) * Series_Reversion( x*(1+x-x³)/(1+x) ). A366071