Properties of the Number 18057

Eighteen Thousand Fifty-Seven

Basics

Value: 18056 → 18057 → 18058

Parity: odd

Prime: No

Previous Prime: 18049

Next Prime: 18059

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 13 × 463

Divisors: 1, 3, 13, 39, 463, 1389, 6019, 18057

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100011010001001

Octal: 43211

Duodecimal: A549

Hexadecimal: 4689

Square: 326055249

Square Root: 134.3763372026489

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

Square array, read by antidiagonals, used to recursively calculate the Springer numbers A001586. A185418

a(n) = 13·n² + 7·n + 1. A168240

G.f.: x/exp( ∑_n>=1 a(n)*xⁿ/n ) = ∑_n>=1 moebius(n)*xⁿ. A195589

a(n) = 1 + ∑_k=1..n-4 a(k) * a(n-k-4). A346076

Integers n > 10563 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10563. A63064

a(n) = 4·n⁴ + 3·n³ + 2·n² + n + 1. A130886

Number of ways, counted up to symmetry, to build a contiguous building with n LEGO blocks of size 1 X 6 which is flat, i.e., with all blocks in parallel position. A123796

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, 1), (0, 1, -1), (1, 1, 1)}. A149611

a(n) = 2·a(n-1) + a(n-3), where a(0) = 3, a(1) = 1, a(2) = 2. A332491

Square pyramidal numbers: a(n) = 0² + 1² + 2² + ... + n² = n*(n+1)*(2·n+1)/6. A330