Properties of the Number 8148

Eight Thousand One Hundred Forty-Eight

Basics

Value: 8147 → 8148 → 8149

Parity: even

Prime: No

Previous Prime: 8147

Next Prime: 8161

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 7 × 97

Divisors: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111010100

Octal: 17724

Duodecimal: 4870

Hexadecimal: 1fd4

Square: 66389904

Square Root: 90.26627277117406

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

Multiples of 14 containing a 14 in their decimal representation. A121034

Infinite lower triangular matrix, M, that satisfies [M²](i,j) = M(i+1,j+1) for all i,j>=0 where [Mⁿ](i,j) denotes the element at row i, column j, of the n-th power of matrix M, with M(0,k)=1 and M(k,k)=1 for all k>=0. A78121

Numbers whose sum of divisors is a cube. A20477

a(n) = ∑_k=1..n k*σ(k). A143128

Rectangular table where column k equals row sums of matrix power A078121^k, read by antidiagonals. A125790

In the interior of a regular 2n-gon with all diagonals drawn, the number of points where exactly three diagonals intersect. A101363

T(n,k)=Number of nXnXn triangular 0..k arrays with some element plus some adjacent element totalling k+1 or k-1 exactly once. A270606

Column 3 of table A125790; also equals row sums of matrix power A078121³. A125793

Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i. A56219

10-step Fibonacci sequence starting with 0,0,0,0,0,0,0,1,0,0. A251760