Properties of the Number 8134

Eight Thousand One Hundred Thirty-Four

Basics

Value: 8133 → 8134 → 8135

Parity: even

Prime: No

Previous Prime: 8123

Next Prime: 8147

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 ² × 83

Divisors: 1, 2, 7, 14, 49, 83, 98, 166, 581, 1162

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111000110

Octal: 17706

Duodecimal: 485A

Hexadecimal: 1fc6

Square: 66161956

Square Root: 90.18869108707588

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

Number of subsets S of T={0,1,2,...,n} such that each element of T is the sum of two (not necessarily distinct) elements of S. A66062

Number of integer partitions of n whose parts do not have choosable sets of integer partitions. A387134

T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,0) and new values introduced in order 0..2. A275228

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero. A299366

Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 37, the first irregular prime. A92230

7 times pentagonal numbers: a(n) = 7·n*(3·n-1)/2. A152744

Second accumulation array, T, of the natural number array A000027, by antidiagonals. A185507

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) = number of parts of p. A241830

a(n) = n - 2^{sum of digits of n}. A328882

a(n) is the total number of down steps between the (n-1)-th and n-th up steps in all 3_1-Dyck paths of length 4·n. A 3_1-Dyck path is a lattice path with steps (1, 3), (1, -1) that starts and ends at y = 0 and stays above the line y = -1. A334979