Properties of the Number 41742

Forty-One Thousand Seven Hundred Forty-Two

Basics

Value: 41741 → 41742 → 41743

Parity: even

Prime: No

Previous Prime: 41737

Next Prime: 41759

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 773

Divisors: 1, 2, 3, 6, 9, 18, 27, 54, 773, 1546

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010001100001110

Octal: 121416

Duodecimal: 201A6

Hexadecimal: a30e

Square: 1742394564

Square Root: 204.30859012777705

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 partitions of n such that the number of parts having multiplicity 1 is a part or the number of distinct parts is a part. A241446

G.f.: exp( ∑_n>=1 xⁿ/n·exp( ∑_k>=1 binomial(2·n*k,n·k)*x^n·k/k ) ). A205503

Numbers n such that 117·2ⁿ-1 is prime. A50584

The smallest of 3 consecutive integers such that the first is divisible by the square of a prime, the second is divisible by the cube of a prime, and the third is divisible by the fourth power of a prime. A349952

If n is composite, replace n with the concatenation of its nontrivial divisors, written in decreasing order, each divisor being written in base 10 with its digits in reverse order, otherwise a(n) = n. A361581

Numerators of continued fraction convergents to sqrt(391). A41742

A symmetrical triangle recursion:q=5;t(n,m,0)=Binomial[n,m];t(n,m,1)=Narayana(n,m);t(n,m,2)=Eulerian(n+1,m);t(n,m,q)=t(n,m,g-2)+t(n,m,q-3). A176560