ℕ atory
Play Now

Properties of the Number 16270

Sixteen Thousand Two Hundred Seventy

Basics

Value: 16269 → 16270 → 16271

Parity: even

Prime: No

Previous Prime: 16267

Next Prime: 16273

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 1627

Divisors: 1, 2, 5, 10, 1627, 3254, 8135, 16270

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11111110001110

Octal: 37616

Duodecimal: 94BA

Hexadecimal: 3f8e

Square: 264712900

Square Root: 127.55391017134677

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 of Look-and-Say partitions of n; see Comments. A239455
G.f. satisfies A(x) = 1 + ∑n>=0 (x·A(x))2n. A75864
Matrix square of triangle A104980. A104988
Let u(1) = x and u(n+1) = (n2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) =(a(n)*x + b(n))/(c(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers. A75827
Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 41", based on the 5-celled von Neumann neighborhood. A285546
Triangle T(n,t) read by rows: number of rooted forests with n 2-colored nodes and t rooted trees. A271878
Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+4x+4y>0. A211626
Number of weakly unimodal compositions of n with absolute difference of successive parts <= 1. A238871
Triangle read by rows: T(m,n) is the label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square. A306197
Number of (finite) line segments formed by drawing all least squares regression lines fitted to n points (j,yj), 0 <= j < n, where each yj is 0 or 1. A371438