Properties of the Number -11002

Eleven Thousand Two

Basics

Value: -11003 → -11002 → -11001

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 2 × 5501

Divisors: 1, 2, 5501, 11002

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -10101011111010

Octal: -25372

Duodecimal: -644A

Hexadecimal: -2afa

Square: 121044004

Square Root: 104.89041900955492

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

The number of Apollonian networks (planar 3-trees) with n+3 vertices. A27610

Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order. A58944

Numbers written in Jacobsthal greedy base. A265747

Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order. A58949

a(n) = (15·n² + 9·n + 2)/2. A220083

Smallest number of each digital type. A266946

Triangle read by rows: T(n,m), n >= 0, 0 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}. A362925

Triangle read by rows: number of labeled partitions of n with maximin m. A113547

Ternary numbers that are concatenated runs A(1)B(1)C(1)A(2)B(2)C(2)...A(k)B(k)C(k), where A(i) is a run of 1's, B(i) a run of 0's, and C(i) a run of 2's, for i = 1..k. A371105

Triangle read by rows: T(n,m), n >= 1, 1 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}. A362924