Properties of the Number 8178

Eight Thousand One Hundred Seventy-Eight

Basics

Value: 8177 → 8178 → 8179

Parity: even

Prime: No

Previous Prime: 8171

Next Prime: 8179

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 29 × 47

Divisors: 1, 2, 3, 6, 29, 47, 58, 87, 94, 141

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111110010

Octal: 17762

Duodecimal: 4896

Hexadecimal: 1ff2

Square: 66879684

Square Root: 90.43229511629129

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

Eulerian numbers (Euler's triangle: column k=2 of A008292, column k=1 of A173018). A295

a(n) = 2ⁿ⁺¹ - n - 2, or partial sums of main diagonal of array A125127 of k-step Lucas numbers. A125128

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

Otto Haxel's guess for magic numbers of nuclear shells. A33547

Positive integers n such that n¹¹ + 1 is semiprime. A105122

Starting from generation 8 add previous and next term yielding generation 9. A48455

a(n) = ∑_k=0..11 C(n, k). A219531

Expansion of e.g.f. e^2x-(1+x)*e^x+x. A130103

Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1). A53979

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 5 6 or 7. A252219