Properties of the Number 18365

Eighteen Thousand Three Hundred Sixty-Five

Basics

Value: 18364 → 18365 → 18366

Parity: odd

Prime: No

Previous Prime: 18353

Next Prime: 18367

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 3673

Divisors: 1, 5, 3673, 18365

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100011110111101

Octal: 43675

Duodecimal: A765

Hexadecimal: 47bd

Square: 337273225

Square Root: 135.51752654177244

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 nXk 0..1 arrays with every element equal to 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300546

Numbers n such that the decimal digits of n² are all prime. A275971

G.f. A(x) satisfies: A(x)³ = x·A( A(x)² + A(x)³ ). A272485

Numbers k such that the continued fraction for sqrt(k) has period 39. A20378

Number of nX3 0..1 arrays with every element equal to 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300541

Number of nX6 0..1 arrays with every element equal to 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300544

Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 15. A51980

A recursion triangle sequence: A(n,k) = A(n-1,k-1)+e(n-1,k) where e(n,k)=Sum[(-1)^j Binomial[n + 1, j](k - j)ⁿ, {j, 0, k}]. A157744

Riordan array(1/(1+x), (1-sqrt(1-4·x))/(2·x)). A278072

G.f. A(x) satisfies: 1 = ∑_n>=0 (-1)ⁿ * x^n*(n+1/2) * ((1+x)ⁿ + A(x))ⁿ⁺¹. A341341