Properties of the Number -11417

Eleven Thousand Four Hundred Seventeen

Basics

Value: -11418 → -11417 → -11416

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 7 ² × 233

Divisors: 1, 7, 49, 233, 1631, 11417

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110010011001

Octal: -26231

Duodecimal: -6735

Hexadecimal: -2c99

Square: 130347889

Square Root: 106.85036265731624

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

Expansion of ∏_j>=1 (1 + (-1 + ∏_k>=1 (1 + x^k))^j). A307128

G.f.: (1 + x⁴ + x⁵ + x⁶ + x¹⁰ + x¹¹ + x¹² + x¹⁶)/∏_i=1..8 (1 - xⁱ). A256975

Triangle read by rows: T(n,k) = number of ways of partitioning the (n+2)-element multiset {1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 2. A291117

a(n) = ∑_{k=0..floor(3·n/14)} binomial(3·n-13·k,k). A392351

Numbers n such that n²⁰⁴⁸ + (n+1)²⁰⁴⁸ is prime. A274235

Expansion of q^-3/4 * η(q)² * η(q²)⁴ * η(q⁸)⁴ / η(q⁴)⁶ in powers of q. A135467

Conjectured positive numbers which have more than one representation (m,s) as a difference s² - m⁵, m >= 1, s > 0. A177770

Number of Weyl group elements, not containing an s₁ factor, which contribute nonzero terms to Kostant's weight multiplicity formula when computing the multiplicity of the zero-weight in the adjoint representation for the Lie algebra of type D and rank n. A234597

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n·b(n), where a(0) = 1, a(1) = 4, b(0) = 2, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296295

a(n) = a(n-1) + a(n-2) + 2 a(floor(n/2)) + 3 a(floor(n/3)) + ... + n a(floor(n/n)), where a(0) = 1, a(1) = 2, a(2) = 3. A298370