Properties of the Number 73561

Seventy-Three Thousand Five Hundred Sixty-One

Basics

Value: 73560 → 73561 → 73562

Parity: odd

Prime: Yes

Previous Prime: 73553

Next Prime: 73571

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 73561

Divisors: 1, 73561

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001111101011001

Octal: 217531

Duodecimal: 366A1

Hexadecimal: 11f59

Square: 5411220721

Square Root: 271.22131184698594

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

Total sum T(n,k) of the sizes of all blocks with maximal element k in all set partitions of {1,2,...,n}; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A270701

Total sum T(n,k) of the sizes of all blocks with minimal element k in all set partitions of {1,2,...,n}; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A270702

a(n) = ∑_m=1..n T(m,n+1-m), array T as in A048887. A48888

Total sum of the sizes of all blocks with maximal element 5 in all set partitions of {1,2,...,n}. A270759

Total sum of the sizes of all blocks with minimal element 6 in all set partitions of {1,2,...,n}. A270769

Primes in A354975. A355009

Product of the square matrix in A065941 and the column vector (1, 2, 3, ...)'. A131913

Number of increasing sequences of n integers x(1),...,x(n) with values in 1..3·n such that x(j) divides x(k) if j divides k. A180385

Primes p such that p - ssd(p) is the square of a prime, where ssd(k) is the sum of the squared decimal digits of k. A227785

Number of Fibonacci numbers F(k), k <= 10ⁿ, whose initial digit is 5. A73561