Properties of the Number 64669

Sixty-Four Thousand Six Hundred Sixty-Nine

Basics

Value: 64668 → 64669 → 64670

Parity: odd

Prime: No

Previous Prime: 64667

Next Prime: 64679

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 11 × 5879

Divisors: 1, 11, 5879, 64669

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111110010011101

Octal: 176235

Duodecimal: 31511

Hexadecimal: fc9d

Square: 4182079561

Square Root: 254.30100275067733

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+2)Xk 0..1 arrays with all rows having a nonnegative second derivative, and all and columns having a positive second derivative in a quadratic least squares fit, with one and two element arrays taken as having a zero second derivative. A223652

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 vertices in the resulting planar graph. A367276

Triangle read by rows: T(n,k) = number of graphs on n node with edge chromatic number k (n >= 1, k >= 1). A123962

a(n) is the sum of the smallest parts of all partitions of n that do not contain 1 as a part. A182708

Number of 0..2 arrays of length n+3 with sum less than 4 in any length 4 subsequence (=less than 50% duty cycle). A212723

Number of (n+2)X3 0..1 arrays with all rows having a nonnegative second derivative, and all and columns having a positive second derivative in a quadratic least squares fit, with one and two element arrays taken as having a zero second derivative. A223647

Partial sums of A092181. A302562

Semiprimes with only semiprime digits, each appearing at least once. A349275

Regard A064413 as giving a permutation of the positive integers; sequence gives (presumed) smallest term in each cycle of this permutation. A64669

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 vertices in the resulting planar graph. A367302