Properties of the Number -11368

Eleven Thousand Three Hundred Sixty-Eight

Basics

Value: -11369 → -11368 → -11367

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 7 ² × 29

Divisors: 1, 2, 4, 7, 8, 14, 28, 29, 49, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110001101000

Octal: -26150

Duodecimal: -66B4

Hexadecimal: -2c68

Square: 129231424

Square Root: 106.62082348209472

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 1/sqrt(1 - 4·x*(1-x)²). A361815

Triangle of the numerators of coefficients c(n,k) = [x^k] P(n,x) of some polynomials P(n,x). A141904

T(n, k) = Stirling1(n+1, k) - Stirling1(n, k-1), for 1 <= k <= n. Triangle read by rows. A94485

Triangle read by rows. The triangle algorithm applied to (-1)ⁿ/n!. A363732

Pentagonal pyramidal numbers: a(n) = n²*(n+1)/2. A2411

Number of labeled connected graphs with n nodes and 0 cutpoints (blocks or nonseparable graphs). A13922

Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2)). A124324

a(n) = tau_n(n) = number of ordered n-factorizations of n. A163767

Triangle read by rows, T(n, k) = ∑_j=0..n C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >= 0 and 0 <= k <= n. A112493

Number of integer partitions of n that are empty, have smallest part not dividing all the others, or greatest part not divisible by all the others. A343346