Properties of the Number 42110

Forty-Two Thousand One Hundred Ten

Basics

Value: 42109 → 42110 → 42111

Parity: even

Prime: No

Previous Prime: 42101

Next Prime: 42131

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 4211

Divisors: 1, 2, 5, 10, 4211, 8422, 21055, 42110

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010010001111110

Octal: 122176

Duodecimal: 20452

Hexadecimal: a47e

Square: 1773252100

Square Root: 205.20721234888407

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

Number of unlabeled trivalent (or cubic) graphs with 2n nodes. A5638

Expansion of ∏_m>=1 ((1+q^2·m-1)/(1+q^2·m))⁵. A29842

Number of distinct circles that can be constructed from an n·n square grid of points using only a compass. A359931

Irregular triangle E(n,g) counting not necessarily connected 3-regular simple graphs on 2n vertices with girth at least g. A185330

Numbers n = x0 x1 x2...x9 such that ξ is the number of digits greater than i in n. A226195

Numbers k such that 403·2^k+1 is prime. A323101

Number of binary words w of length n such that the number of distinct blocks of length k that w contains is <= k+2 for all k. A297526

G.f.: A(x) = 1 + x*(1 + x*(1 + x*(...(1 + x*(...)²ⁿ)...)⁶)⁴)². A138212

Staircase on Pascal's triangle. A81181

Number of connected k-regular graphs on 2·n nodes with maximal diameter D(n,k) A296525 written as array T(n,k), 2 <= k < 2·n. A296526