Properties of the Number 84425

Eighty-Four Thousand Four Hundred Twenty-Five

Basics

Value: 84424 → 84425 → 84426

Parity: odd

Prime: No

Previous Prime: 84421

Next Prime: 84431

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 ² × 11 × 307

Divisors: 1, 5, 11, 25, 55, 275, 307, 1535, 3377, 7675

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10100100111001001

Octal: 244711

Duodecimal: 40A35

Hexadecimal: 149c9

Square: 7127580625

Square Root: 290.55980451535277

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 nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero. A299089

a(n) = ∑_k=0..n binomial(n,k) * binomial(n+k,k) * (-n)^n-k. A335310

Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero. A299084

Let b(0) = n, b(2·k+1) = c, where c > b(m) is the smallest number such that gcd(c,b(2·k))=1, b(2·k+2) = e where e < b(m) is the smallest number such that gcd(e,b(2·k+1))=1 for m = 0..2·k, until reaching e = 1. Then a(n) = the last c. A84425