Properties of the Number 42966

Forty-Two Thousand Nine Hundred Sixty-Six

Basics

Value: 42965 → 42966 → 42967

Parity: even

Prime: No

Previous Prime: 42961

Next Prime: 42967

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 7 × 11 × 31

Divisors: 1, 2, 3, 6, 7, 9, 11, 14, 18, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011111010110

Octal: 123726

Duodecimal: 20A46

Hexadecimal: a7d6

Square: 1846077156

Square Root: 207.2824160414964

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

Consider the base-4 Kaprekar map n->K(n) defined in A165012. Sequence gives numbers belonging to cycles, including fixed points. A165017

Consider the base-4 Kaprekar map n->K(n) defined in A165012. Sequence gives numbers belonging to cycles of length greater than 1. A165019

Write cosec x = 1/x + Sum e_n x^2n-1/(2n-1)!; sequence gives denominators of e_n. A36283

Number of partitions of n containing m(1) as a part, where m denotes multiplicity. A240486

Number of partitions p of n such that the number of parts is a part or max(p) - min(p) is a part. A241386

A Jacobsthal-Pascal triangle. A124860

Numbers k such that 7^k == -1 (mod k-1). A55690

Number of 5-leaf rooted trees with n levels. A7715

a(n) = T(n,n-3), where T is the array in A026374. A26382

Triangle read by rows: T(n,k) = (n+1,k)-th element of (M⁴-M)/3, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n. A96035