Properties of the Number 69988

Sixty-Nine Thousand Nine Hundred Eighty-Eight

Basics

Value: 69987 → 69988 → 69989

Parity: even

Prime: No

Previous Prime: 69959

Next Prime: 69991

Digit Sum: 40

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 17497

Divisors: 1, 2, 4, 17497, 34994, 69988

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001000101100100

Octal: 210544

Duodecimal: 34604

Hexadecimal: 11164

Square: 4898320144

Square Root: 264.55245226608656

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) is the number of n X k 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors). A208353

Place n equally spaced points on each side of a square, and join each of these points by a chord to the 3·n new points on the other three sides: sequence gives number of regions in the resulting planar graph. A367278

Number of nX2 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors). A208347

a(n) = smallest multiple of 4 with sum of digits = n. A77489

Number of nX6 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors). A208351

Number of (n+3) X 8 0..2 matrices with each 4 X 4 subblock idempotent. A224725

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n·k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph. A367304

(-1)ⁿ⁺¹/6·sum(k=1,2n+1,C(2n+1,k)*B(k)*3^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers. A69988