Properties of the Number 42111

Forty-Two Thousand One Hundred Eleven

Basics

Value: 42110 → 42111 → 42112

Parity: odd

Prime: No

Previous Prime: 42101

Next Prime: 42131

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 4679

Divisors: 1, 3, 9, 4679, 14037, 42111

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010010001111111

Octal: 122177

Duodecimal: 20453

Hexadecimal: a47f

Square: 1773336321

Square Root: 205.20964889595226

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

Triangle read by rows: T(n,k) is the number of oriented colorings of the edges of a regular n-dimensional simplex using exactly k colors. Row n has (n+1)*n/2 columns. A327087

a(n) = sum of all divisors of all numbers k such that n² <= k < (n+1)². A168012

Odd terms of A059756. A111042

Positions of hexagonal pyramidal numbers in the EKG sequence. A144080

The lexicographically earliest "Increasing Term Fractal Jump Sequence" that does not use the digit 0 in any terms. A359385

Expansion of ∏_k>=1 1 / ((1 - x^k) * (1 - x^k²) * (1 - x^k³)). A369576

Number of partitions satisfying cn(2,5) < cn(1,5) + cn(4,5) and cn(3,5) < cn(1,5) + cn(4,5). A39889

Concatenation of multiplicities of prime divisors of highly composite numbers A002182(n). A245500

a(n) is the smallest composite number obtained by appending one or more 1's to n. A358154

[ exp(1/23)*n! ]. A30828