Properties of the Number 93578

Ninety-Three Thousand Five Hundred Seventy-Eight

Basics

Value: 93577 → 93578 → 93579

Parity: even

Prime: No

Previous Prime: 93563

Next Prime: 93581

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 × 71 × 659

Divisors: 1, 2, 71, 142, 659, 1318, 46789, 93578

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10110110110001010

Octal: 266612

Duodecimal: 461A2

Hexadecimal: 16d8a

Square: 8756842084

Square Root: 305.9052140778251

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

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing. A203787

a(1) = 2; a(n) = half of the a(n-1)-th even nontotient number. A72416

Number of integers in n-th generation of tree T(-5/2) defined in Comments. A274155

Number of (n+1) X 2 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing. A203780

Number of (n+1)X6 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing. A203784

Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having determinant equal to one, with rows and columns of the latter in nondecreasing lexicographic order. A227637

Take n sheets of paper, arrange them into piles, write on each sheet the cardinality (number of sheets) of its pile. Do this again, so each sheet is labeled by an ordered pair of positive integers. How many ways can this be done so that every sheet has a unique label? (Only distinct sets of labels count, not every permutation of the labels or sheets.). A93578