ℕ atory
Play Now

Properties of the Number 16156

Sixteen Thousand One Hundred Fifty-Six

Basics

Value: 16155 → 16156 → 16157

Parity: even

Prime: No

Previous Prime: 16141

Next Prime: 16183

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 2 × 7 × 577

Divisors: 1, 2, 4, 7, 14, 28, 577, 1154, 2308, 4039

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111100011100

Octal: 37434

Duodecimal: 9424

Hexadecimal: 3f1c

Square: 261016336

Square Root: 127.10625476348518

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

A self-generating sequence: every positive integer occurs as a(i)-a(j) for a unique pair i,j. A1856
Number of strict solid partitions of n. A323657
a(n) = A000094(n+4) - A006918(n). A84835
The Wiener index of the comb-shaped graph |_|_|...|_| with 2n (n>=1) nodes. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph. A192023
Numerator of Hermite(n, 7/15). A159516
Partial sums of A193911. A193912
Hosoya triangle of Pell-Lucas type. A284126
a(n) is the number of essentially different ways in which the integers 1,2,3,...,2n can be arranged in a circle such that (1) all pairs of adjacent integers sum to a prime number and (2) all pairs of integers opposite each other on the circle sum to a prime. A73467
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (1, 0, 1), (1, 1, -1), (1, 1, 1)}. A150975
Numbers n such that when the n-th Catalan restricted growth string [bk, bk-1, ..., b2, b1] (see A239903) is viewed as a simple numeral in Catalan Base: bk*C(k) + bk-1*C(k-1) + ... + b2*C(2) +b1*C(1) it differs from n. Here C(m) = A000108(m). A244156