Properties of the Number 58981

Fifty-Eight Thousand Nine Hundred Eighty-One

Basics

Value: 58980 → 58981 → 58982

Parity: odd

Prime: No

Previous Prime: 58979

Next Prime: 58991

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 13 ² × 349

Divisors: 1, 13, 169, 349, 4537, 58981

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1110011001100101

Octal: 163145

Duodecimal: 2A171

Hexadecimal: e665

Square: 3478758361

Square Root: 242.86004199950224

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

G.f.: A(x) = exp(∑_n>=1 C(2n-1,n)*L(n)*xⁿ/n) such that ∑_n>=1 L(n)*xⁿ/n = log(1+x·A(x)) where L(n) = A158259(n) and C(2n-1,n) = A001700(n-1). A158109

Generalized Fibonacci numbers Fib(n + 0.5) rounded to an integer. A158510

Number of length 7+4 0..n arrays with every five consecutive terms having four times some element equal to the sum of the remaining four. A249663

a(n) = floor(sqrt(Fibonacci(n+1)*Fibonacci(n))). A354210

T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having four times some element equal to the sum of the remaining four. A249656

Improperly Reduced Fibonacci Sequence: begin with a(0) = 0, a(1) = 1 and a(n) = [ a(n-1) + a(n-2) ] / a(k). a(k) is the first (not necessarily the greatest) term including 1 which divides a(n-1) + a(n-2) not previously used. A58981

L.g.f.: exp(∑_n>=1 a(n)*xⁿ/n) = 1 + x·exp(∑_n>=1 C(2n-1,n)*a(n)*xⁿ/n) where C(2n-1,n) = A001700(n-1). A158259