Properties of the Number -13442

Thirteen Thousand Four Hundred Forty-Two

Basics

Value: -13443 → -13442 → -13441

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 11 × 13 × 47

Divisors: 1, 2, 11, 13, 22, 26, 47, 94, 143, 286

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11010010000010

Octal: -32202

Duodecimal: -7942

Hexadecimal: -3482

Square: 180687364

Square Root: 115.93963946813014

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)=Number of nXnXn triangular 0..k arrays with every horizontal row nondecreasing and having the same average value. A214906

Number of irreducible alternating Euler sums of depth 6 and weight 6+2n. A11796

Irregular table read by rows: T(n,k) is the number of k-gons, k>=3, formed inside a right triangle by the straight line segments mutually connecting all vertices and points on the two shorter edges whose positions on one edge equal the Farey series of order n while on the other they divide its length into n equal segments. A359977

Numbers n such that { x +- 2^k : 0 < k < 4 } are primes, where x = 210·n - 105. A61671

Number of subsets of 6 integers between 1 and n such that their sum is 0 modulo n. A381289

Triangle read by rows: T(n,k) = number of 2 X inf arrays [ n, n1, n2, ...; k, k1, k2,... ] with n>=n1>n2>...>=0, k>=k1>k2...>=0, n>k, n1>k1, ...; n >= 1, k >= 0. Note that once ni or ki = 0, the strict inequalities become equalities (constant 0 thereafter). A39597

Expansion of 2*(1-x)*(2·x²+4·x+1) / (1-x-x²)². A271786

Triangle read by rows: T(n,k) (0<=k<=n) given by T(n,0)=1, T(n,n) = binomial(2n,n); otherwise T(n,k) = T(n,k-1)+T(n-1,k). A274292

Number of 4-element subsets that can be chosen from {1,2,...,4·n} having element sum 8·n+2. A204468

Numbers k such that Fibonacci(k) == +-1 (mod k) and k is neither 1 nor prime nor twice a prime. A279072