Properties of the Number 98064

Ninety-Eight Thousand Sixty-Four

Basics

Value: 98063 → 98064 → 98065

Parity: even

Prime: No

Previous Prime: 98057

Next Prime: 98081

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ³ × 227

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10111111100010000

Octal: 277420

Duodecimal: 48900

Hexadecimal: 17f10

Square: 9616548096

Square Root: 313.15172041679733

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

Expansion of g.f.: 1/((1 - x - x² + x⁶ - x⁸)*(1 - x² + x⁶ + x⁷ - x⁸)). A147620

E.g.f. satisfies A(x) = log(1 + x·exp(A(x))) * exp(A(x)). A357349

Expansion of e.g.f. cosh(sin(log(1+x))). A9141

a(n) = n! * ∑_k=0..n binomial(2·n, 2·k) / binomial(n,k). A182525

This sequence needs a meaningful name. A121796

a(n) is the smallest number m such that σ(m)=n*π(m), or 0 if no such m exists. A137602

Number of length-n sequences A over {1,2,3} with the property that all of r(A), r(r(A)), etc. are over {1,2,3}, where r is the sequence obtained by taking the run lengths in A. A181047

E.g.f. satisfies: A(x) = (1 + x·A(x))^A(x). A162655

Least k such that k·prime(n)#/6 - 6 and k·prime(n)#/6 + 6 are consecutive primes with gap of 12 for n > 2. A98064

Number of 4 X n 0-1 matrices which have n+3 1's and have no zero rows or zero columns. A84486