Properties of the Number 8149

Eight Thousand One Hundred Forty-Nine

Basics

Value: 8148 → 8149 → 8150

Parity: odd

Prime: No

Previous Prime: 8147

Next Prime: 8161

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 29 × 281

Divisors: 1, 29, 281, 8149

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 1111111010101

Octal: 17725

Duodecimal: 4871

Hexadecimal: 1fd5

Square: 66406201

Square Root: 90.27181176868004

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

a(n) = (n³ + 2·n)/3. A6527

a(n) = (2·n+1)*(4·n²+4·n+3)/3. A57813

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264

Pseudoprimes to base 10. A5939

Array read by antidiagonals: A(n,k) is the number of nonisomorphic T₀ n-regular set multipartitions (multisets of sets) on a k-set. A331508

22-gonal numbers: a(n) = n*(10·n-9). A51874

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231

One third of product plus sum of three consecutive nonnegative integers; a(n)=(n+1)(n²+2n+3)/3. A167875

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any west or southwest neighbors modulo n and the upper left element equal to 0. A267562