ℕ atory
Play Now

Properties of the Number 84910

Eighty-Four Thousand Nine Hundred Ten

Basics

Value: 84909 → 84910 → 84911

Parity: even

Prime: No

Previous Prime: 84871

Next Prime: 84913

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 7 × 1213

Divisors: 1, 2, 5, 7, 10, 14, 35, 70, 1213, 2426

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10100101110101110

Octal: 245656

Duodecimal: 4117A

Hexadecimal: 14bae

Square: 7209708100

Square Root: 291.3932051369764

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

T(n,k) = Number of n X k nonnegative integer arrays with upper left 0 and lower right n+k-6 and value increasing by 0 or 1 with every step right or down. A252930
Numbers k such that N = k6 is a twin rank (cf. A002822: 6N +- 1 are twin primes). A326236
Irregular triangle read by rows: T(n,d) (n >= 1, 0 <= d <= 2n-2) = number of n X n integer-valued matrices M such that M1,1=0, Mn,n=d, and M(i+1),j = Mi,j + (0 or 1), Mi,(j+1) = Mi,j + (0 or 1). A323849
Number of n X n nonnegative integer arrays with upper left 0 and lower right n+n-6 and value increasing by 0 or 1 with every step right or down. A252923
Number of n X n integer matrices (mi,j) such that m1,1=1, mn,n=n, and all rows and columns are (weakly) monotonic without jumps larger than 1. A306372
Number of nX5 nonnegative integer arrays with upper left 0 and lower right n+5-6 and value increasing by 0 or 1 with every step right or down. A252927
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 1, -1), (0, 1, 1), (1, -1, 0)}. A148874
Fibonacci numbers that satisfy: ∑k>=1 1/a(k) = τ-1, such that the partial sums are nearest to, but never exceed, τ-1 = (sqrt(5)-1)/2. A84910