Properties of the Number 8906

Eight Thousand Nine Hundred Six

Basics

Value: 8905 → 8906 → 8907

Parity: even

Prime: No

Previous Prime: 8893

Next Prime: 8923

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 61 × 73

Divisors: 1, 2, 61, 73, 122, 146, 4453, 8906

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001011001010

Octal: 21312

Duodecimal: 51A2

Hexadecimal: 22ca

Square: 79316836

Square Root: 94.37160589923221

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) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly n ways, or 0 if no such number exists. A350241

Least number·such that xⁿ has n digits equal to k. Case k = 6. A285453

The sequence m(n) in A022905. A22907

a(n) = Sum of all numbers of divisors of all numbers < (n+1)². A168011

Solutions to φ(n) = φ(σ(n)) that are not given by Theorem 3 of Golomb's manuscript. A260021

Constant term of the reduction by x² -> x+1 of the polynomial p(n,x) defined at Comments. A192973

Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of the matrix at A204112, given by f(i,j) = gcd(F(i+1), F(j+1)), where F=A000045 (Fibonacci numbers). A204113

Approximation of the 2-adic integer arctan(2) up to 2ⁿ. A309751

Number of basis partitions of n+16 with Durfee square size 4. A53798

Least number k not divisible by 10 such that the decimal expansion of kⁿ contains some digit exactly n times. A243151