Properties of the Number 44391

Forty-Four Thousand Three Hundred Ninety-One

Basics

Value: 44390 → 44391 → 44392

Parity: odd

Prime: No

Previous Prime: 44389

Next Prime: 44417

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 14797

Divisors: 1, 3, 14797, 44391

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010110101100111

Octal: 126547

Duodecimal: 21833

Hexadecimal: ad67

Square: 1970560881

Square Root: 210.69171791980813

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 maximal subsets of {1..n} containing n such that every pair of distinct elements has a different quotient. A325869

T(n,k)=Half the number of nXk binary arrays with no 1 having an adjacent 1 both above and to its left. A184761

a(n) = A293518(n) - A293519(n); how many more surviving even nodes than surviving (but not bifurcating) odd nodes there are at generation n in the binary tree of persistently squarefree numbers. A293517

Half the number of n X 3 binary arrays with no 1 having an adjacent 1 both above and to its left. A184755

Half the number of n X 6 binary arrays with no 1 having an adjacent 1 both above and to its left. A184758

Number of (k+1)-tuples of integers modulo n (x₁,...,x_k,s) such that at least one subset of the x_i sums to s mod n. In other words, n^k times the expected number of distinct subset sums mod n of k integers mod n chosen uniformly at random. Read by antidiagonals, i.e., with entries in the order (n,k)=(1,1),(1,2),(2,1),(1,3),(2,2),(3,1),... A98966

Numbers n such that string 5,9 occurs in the base 10 representation of n but not of n-1. A44391