Properties of the Number 41952

Forty-One Thousand Nine Hundred Fifty-Two

Basics

Value: 41951 → 41952 → 41953

Parity: even

Prime: No

Previous Prime: 41947

Next Prime: 41953

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 19 × 23

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 19, 23

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010001111100000

Octal: 121740

Duodecimal: 20340

Hexadecimal: a3e0

Square: 1759970304

Square Root: 204.82187383187372

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

Amicable triples: numbers such that σ(x) = σ(y) = σ(z) = x+y+z, x<y<z. We order these triples according to the common value of σ. Sequence gives z numbers. A125492

Least number·such that xⁿ has n digits equal to k. Case k=4. A285451

Triangle read by rows: T(k,n) (k >= 0, n = 0, ..., k) = number of tilings of a k X n rectangle using 2 X 2 tiles, right trominoes and dominoes. A354010

Binomial transform of A215495(n). A217988

Numbers that belong to at least one amicable tuple. A255215

Number of parts in all partitions of n with largest multiplicity three. A320373

a(n) is the permanent of a square matrix M(n) whose general element M_i,j is defined by floor((j - i + 1)/2). A350549

Number of tilings of an n X n square using right trominoes, dominoes, and 2 X 2 tiles. A354119

a(n) = (n² - n + 2) * (5·n² - 5·n + 2) / 4. A380353

Integers k such that there exists an integer 0<m<k such that (1/σ(m)² + 1/σ(k)²)*(m+k)² = 1. A383964