Properties of the Number 16228

Sixteen Thousand Two Hundred Twenty-Eight

Basics

Value: 16227 → 16228 → 16229

Parity: even

Prime: No

Previous Prime: 16223

Next Prime: 16229

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 4057

Divisors: 1, 2, 4, 4057, 8114, 16228

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111101100100

Octal: 37544

Duodecimal: 9484

Hexadecimal: 3f64

Square: 263347984

Square Root: 127.38916751435343

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 partitions of n such that the number of parts is divisible by the smallest part. A168657

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the upper median unequal to the lower median in every 2X2 subblock. A235849

a(n) = ∑_i=0..n digsum(i)³, where digsum(i) = A007953(i). A231688

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 267", based on the 5-celled von Neumann neighborhood. A280461

a(n) is the numerator of (120·n² + 151·n + 47)/(512·n⁴ + 1024·n³ + 712·n² + 194·n + 15). A374580

Numbers k such that k - sopfr(k) is a positive cube. A389889

Row sums of the array A274193, defined by g(n,k) = 1 for n >= 0; g(n,k) = 0 if k > n; g(n,k) = g(n-1,k-1) + g(n-1,3k) for n > 0, k > 1. A274194

Table read by antidiagonals: T(n, k) is the sum of the numbers inside the k-th square of size n X n when the square spiral is tiled with these squares, where each tile contains numbers which sum to the minimum possible value, and each number on the spiral can only be in one tile. A341363

Number of slanted n X 4 (i=1..n) X (j=i..4+i-1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 3 neighbors with the same value. A165381

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 70 ones. A31838