Properties of the Number 18357

Eighteen Thousand Three Hundred Fifty-Seven

Basics

Value: 18356 → 18357 → 18358

Parity: odd

Prime: No

Previous Prime: 18353

Next Prime: 18367

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 29 × 211

Divisors: 1, 3, 29, 87, 211, 633, 6119, 18357

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100011110110101

Octal: 43665

Duodecimal: A759

Hexadecimal: 47b5

Square: 336979449

Square Root: 135.4880068493149

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

Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1); triangle T(n,k), n>=0, read by rows. A243752

Number of surviving (but not bifurcating) nodes at generation n in the binary tree of persistently squarefree numbers (see A293230). A293521

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+119)² = y². A129837

a(n) = number of steps required to reach 0 from F(n+2) by repeatedly subtracting from a natural number the number of ones in its Zeckendorf representation. Here F(n) = the n-th Fibonacci number, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, ... A261082

Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k UDUU's, 0 <= k <= floor((n-1)/2). A116424

Number of Dyck paths of semilength n having exactly two (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1). A243771

Rounded base-3 logarithm of A082126(n). A82127

The first 10 digits of the cube root of n contain the digits 0-9. A119517

Nonprime numbers k of the form 4·m+1 such that ∑_j=0..k-1 2^j * binomial(3·j, j) == 1 (mod k). A373747

Divisors of 252. A18357