Properties of the Number 69023

Sixty-Nine Thousand Twenty-Three

Basics

Value: 69022 → 69023 → 69024

Parity: odd

Prime: No

Previous Prime: 69019

Next Prime: 69029

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 23 × 3001

Divisors: 1, 23, 3001, 69023

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10000110110011111

Octal: 206637

Duodecimal: 33B3B

Hexadecimal: 10d9f

Square: 4764174529

Square Root: 262.72228683535775

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..2 arrays with the maximum plus the minimum of every 2X2 subblock equal. A238180

T(n,k)=Number of nXk 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to at least one horizontal or vertical neighbor. A199588

Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + 4·x)/(1 - 3·x - 8·x²). A179599

Numbers k such that k and k+1 are both divisible by the total binary weight of their divisors (A093653). A338514

Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the minimum of every 2X2 subblock equal. A238174

Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the minimum of every 2X2 subblock equal. A238175

Number of nX4 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to at least one horizontal or vertical neighbor. A199586

Number of n X 5 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to at least one horizontal or vertical neighbor. A199587

Define a subset of divisors of n to be a dedicated subset if the product of any two members is also a divisor of n. 1 is not allowed as a member as it gives trivially 1·d = d a divisor. a(n) is the number of dedicated subsets of divisors of n with at least two members. A69023

Number of nX6 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 0 1 1 vertically. A207906