Properties of the Number 42610

Forty-Two Thousand Six Hundred Ten

Basics

Value: 42609 → 42610 → 42611

Parity: even

Prime: No

Previous Prime: 42589

Next Prime: 42611

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 4261

Divisors: 1, 2, 5, 10, 4261, 8522, 21305, 42610

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011001110010

Octal: 123162

Duodecimal: 207AA

Hexadecimal: a672

Square: 1815612100

Square Root: 206.42189806316577

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

2-Fubini numbers. A232472

a(n) = ∑_k=0..n binomial(k+4,4) * binomial(2·k,2·n-2·k). A382471

T(n,k) = ∑_i=0..k (-1)^k-i*binomial(k,i)*A000670(n-k+i). A122101

Number of ordered set partitions of [n] such that for each block b the smallest integer interval containing b has at most six elements. A276896

Number of compositions of n into distinct parts where each part i is marked with a word of length i over a quinary alphabet whose letters appear in alphabetical order. A261843

Triangle of F(n,r) of r-geometric numbers, 1 <= r <= n. A219374

Number A(n,k) of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order; square array A(n,k), n>=0, k>=0, read by antidiagonals. A261835

Number A(n,k) of ordered set partitions of [n] such that for each block b the smallest integer interval containing b has at most k elements; square array A(n,k), n>=0, k>=0, read by antidiagonals. A276890

Numerators of continued fraction convergents to sqrt(834). A42610