Properties of the Number 65326

Sixty-Five Thousand Three Hundred Twenty-Six

Basics

Value: 65325 → 65326 → 65327

Parity: even

Prime: No

Previous Prime: 65323

Next Prime: 65327

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 89 × 367

Divisors: 1, 2, 89, 178, 367, 734, 32663, 65326

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111100101110

Octal: 177456

Duodecimal: 3197A

Hexadecimal: ff2e

Square: 4267486276

Square Root: 255.5895146519121

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+1)X(k+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with values 0..3 introduced in row major order. A231343

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood. A287509

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 429", based on the 5-celled von Neumann neighborhood. A288192

G.f. satisfies A(x) = (1 + x⁴) * (1 + x·A(x)²). A364330

Difference between 4ⁿ and the product of primes less than or equal to n. A319857

Number of (n+1)X(3+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with values 0..3 introduced in row major order. A231339

Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by more than one. A269584

a(n) is the number of distinct pairs that can be made in exactly n iterations of either of the two maps (x, y) -> (x OR (2^y), 0) or (x, y) -> (x, y+1), starting from (0,0). A353150

Numbers such that 79 'Reverse and Add' steps are needed to reach a palindrome. A65326