Properties of the Number 41393

Forty-One Thousand Three Hundred Ninety-Three

Basics

Value: 41392 → 41393 → 41394

Parity: odd

Prime: No

Previous Prime: 41389

Next Prime: 41399

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 11 × 53 × 71

Divisors: 1, 11, 53, 71, 583, 781, 3763, 41393

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010000110110001

Octal: 120661

Duodecimal: 1BB55

Hexadecimal: a1b1

Square: 1713380449

Square Root: 203.45269720502603

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

Expansion of e.g.f. exp(x·exp(x)). A248

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where sequence a_k of column k is the exponential transform of C(n,k). A145460

Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n. A143398

Number A(n,k) of endofunctions f on [n] such that f^k(i) = f(i) for all i in [n]; square array A(n,k), n>=0, k>=0, read by antidiagonals. A245501

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the exponential transform of the k-th powers. A279636

Triangle read by rows: T(n,k) = number of forests of labeled rooted trees with n nodes and height at most k (n>=1, 0<=k<=n-1). A210725

Numbers whose sum of divisors is a sixth power. A19424

Numbers whose sum of divisors is 6⁶ = 46656. A48256

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = k! * ∑_i=0..n-1 binomial(n-1,i) * binomial(i+1,k) * T(n-1-i,k) for n > 0. A292978

Triangle T, read by rows, equal to Pascal's triangle to the matrix power of Pascal's triangle, so that T = C^C, where C(n,k) = binomial(n,k) and T(n,k) = A000248(n-k)*C(n,k). A116071