Properties of the Number 28941

Twenty-Eight Thousand Nine Hundred Forty-One

Basics

Value: 28940 → 28941 → 28942

Parity: odd

Prime: No

Previous Prime: 28933

Next Prime: 28949

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 11 × 877

Divisors: 1, 3, 11, 33, 877, 2631, 9647, 28941

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000100001101

Octal: 70415

Duodecimal: 148B9

Hexadecimal: 710d

Square: 837581481

Square Root: 170.12054549642144

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

a(n) = sum(stirling2(n,k)*(k+2)!*(k+3)!, k=1..n)/144. A262960

Total number of parts of the second sort in all partitions of n into two sorts of parts. A278464

Number of partitions in parts not of the form 23k, 23k+1 or 23k-1. Also number of partitions with no part of size 1 and differences between parts at distance 10 are greater than 1. A35989

Denominator of X-coordinate of n·P where P is the generator [0,0] for rational points on curve y²+y = x³-x. A28941

Table read by antidiagonals: T(n,k) (n >= 3, k >= 0) is the number of vertices in a regular n-gon after k generations of mitosis. A350501

Diagonal element T(n,n) of the infinite array with T(n,1) = T(1,n) = Fibonacci(n) and recursively T(n,k) = T(n-1,k-1) + T(n,k-1) + T(n-1,k). A193913