Properties of the Number 8902

Eight Thousand Nine Hundred Two

Basics

Value: 8901 → 8902 → 8903

Parity: even

Prime: No

Previous Prime: 8893

Next Prime: 8923

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 4451

Divisors: 1, 2, 4451, 8902

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10001011000110

Octal: 21306

Duodecimal: 519A

Hexadecimal: 22c6

Square: 79245604

Square Root: 94.35041070392857

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 integer compositions of n whose leaders of strictly decreasing runs are identical. A374760

Number of possible chess games at the end of the n-th ply. A48987

Number of pairwise coprime compositions of n with no 1's, where a singleton is not considered coprime. A337697

Number of possible chess games at the end of the n-th ply plus number of games that terminate (i.e., mate) in fewer than n plies. A6494

a(n) = T(n,n+2), T given by A027052. A27053

a(n) = ∑_k=0..n 5^n-k * binomial(n-1,n-k) * binomial(2·k,k). A360321

Write 2·x/(1-x) in the form ∑_j>=1 ((1-x^j)^a(j) - 1). A290973

Consider the version of the Collatz or 3x+1 problem where x -> x/2 if·is even, x -> (3x+1)/2 if·is odd. Define the stopping time of·to be the number of steps needed to reach 1. Sequence gives the number of integers·with stopping time n. A60322

Number of 1243-avoiding even Grassmannian permutations of size n. A361272

Number of compositions (ordered partitions) of n into an odd number of triangular numbers. A339417