Properties of the Number 69402

Sixty-Nine Thousand Four Hundred Two

Basics

Value: 69401 → 69402 → 69403

Parity: even

Prime: No

Previous Prime: 69401

Next Prime: 69403

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 43 × 269

Divisors: 1, 2, 3, 6, 43, 86, 129, 258, 269, 538

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000111100011010

Octal: 207432

Duodecimal: 341B6

Hexadecimal: 10f1a

Square: 4816637604

Square Root: 263.4425933671319

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

Expansion of ∏_k>=1 (1 + 2·x^k)/(1 - x^k). A264686

Number of binary words of length n such that in every prefix and in every suffix the difference between the number of 1's and the number of 0's is in the interval [-2,3]. A306306

Number of nX5 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A299455

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A299458

The hyper-Wiener index of the nanostar dendrimer NS₁[n], defined pictorially in the A. R. Ashrafi et al. reference. A224438

Half the number of 9 X n binary arrays with a path of adjacent 1's and a path of adjacent 0's from top row to bottom row. A69402