ℕ atory
Play Now

Properties of the Number 18270

Eighteen Thousand Two Hundred Seventy

Basics

Value: 18269 → 18270 → 18271

Parity: even

Prime: No

Previous Prime: 18269

Next Prime: 18287

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 2 × 5 × 7 × 29

Divisors: 1, 2, 3, 5, 6, 7, 9, 10, 14, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 100011101011110

Octal: 43536

Duodecimal: A6A6

Hexadecimal: 475e

Square: 333792900

Square Root: 135.16656391282572

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 collections of nonempty multisets with a total of n objects of exactly k colors; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A255903
Numbers k such that the central binomial coefficient C(2k,k) is divisible by k2. A121943
Subset of A020342 (vampire numbers, definition 1) listing numbers which have more than one such representation of the desired form. A144563
Consider the e.g.f. A(x,y) = ∑n>=0 ∑k=0..n T(n,k) * x2·n-2·k+1 * y2·k / (2·n+1)! and related functions B(x,y) and C(x,y), as defined in the Formula section. Sequence gives the triangular array of coefficients T(n,k) (n>=0, 0<=k<=n) of A(x,y). A326797
Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2. A8971
Number of permutations of [n] with exactly 2 increasing runs of length at least 2. A363
Row sums of triangle A134480. A134481
Triangle of polynomial coefficients related to the o.g.f.s. of the RBS1 polynomials. A160486
Terms satisfy: a(2·n) = a(n)*b(n) and a(2·n+1) = a(n)*b(n+1) for n>=0 with a(0)=1, where A(x)2 = ∑n>=0 b(n)*xn and g.f. A(x) = ∑n>=0 a(n)*xn. A257889
Integers k such that ω(k) = ω(k-1) + ω(k-2) + ω(k-3), where ω(n) is the number of distinct prime factors of n. A76252