Properties of the Number -11062

Eleven Thousand Sixty-Two

Basics

Value: -11063 → -11062 → -11061

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 5531

Divisors: 1, 2, 5531, 11062

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10101100110110

Octal: -25466

Duodecimal: -649A

Hexadecimal: -2b36

Square: 122367844

Square Root: 105.17604289951205

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

T(n,k) = coefficient of xⁿ*y^k in A(x,y) such that: x = ∑_n=-oo..+oo (-1)ⁿ * xⁿ * (y + xⁿ)ⁿ * A(x,y)ⁿ. A359720

Number of integer partitions of n with superdiagonal run-lengths. A388714

Expansion of ∏_k>=1 ((1 - 2^k*x^k)/(1 + 2^k*x^k))^{1/2^k}. A303439

Least integer N > 2 such that the number of primes (<=N) <= the number of base-n-zero containing numbers (<=N). A306521

Numbers m > 3 such that m-1, m, m+1 belong to A307002. A340748

a(n) = A359720(n+2,1), for n >= 0. A359725

Number of primes p such that n!-p is prime. A140088

Number of distinct solutions of ∑_i=1..2 (x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1. A180773

Numbers k such that ∑_i=1..k d(i)² is a square c², where d(i) is the number of divisors of i. A186429

The Wiener index of the graph obtained by applying Mycielski's construction to the path graph on n vertices (n>=2). A228321