Properties of the Number 16160

Sixteen Thousand One Hundred Sixty

Basics

Value: 16159 → 16160 → 16161

Parity: even

Prime: No

Previous Prime: 16141

Next Prime: 16183

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁵ × 5 × 101

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 32, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11111100100000

Octal: 37440

Duodecimal: 9428

Hexadecimal: 3f20

Square: 261145600

Square Root: 127.12198865656563

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

Column 0 of square array A211970 (in which column 1 is A000041). A211971

a(1)=5, a(2)=2, a(n) = 5·a(n-1) + 2·a(n-2). A189746

E.g.f.: A(x,y) = exp(-1-y) * ∑_n>=0 (exp(n·x) + y)ⁿ / n!, where A(x,y) = ∑_n>=0 xⁿ/n! * ∑_k=0..n T(n,k)*y^k, as a triangle of coefficients T(n,k) read by rows. A326600

G.f. satisfies A(x) = 1 + x·A(x)⁴*(1 + x·A(x)²). A365181

Triangle read by rows: T(n,k) is the number of digraphs on n labeled nodes with k arcs and a global source and sink, n >= 1, k = 0..max(1,n-1)*(n-2)+1. A350791

Position of sqrt(n) in the mapping N2QuQR1 given in A065936. A65938

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 302", based on the 5-celled von Neumann neighborhood. A287541

a(n) = sum of 2^k-1 such that floor(n/prime(k)) is odd. A371906

Number of asymmetric mobiles (circular rooted trees) with n nodes and 3 leaves. A55364

Antidiagonal sums of table A083362. A83364