Properties of the Number 16179

Sixteen Thousand One Hundred Seventy-Nine

Basics

Value: 16178 → 16179 → 16180

Parity: odd

Prime: No

Previous Prime: 16141

Next Prime: 16183

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5393

Divisors: 1, 3, 5393, 16179

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11111100110011

Octal: 37463

Duodecimal: 9443

Hexadecimal: 3f33

Square: 261760041

Square Root: 127.19669807035086

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 multisets of exactly eight partitions of positive integers into distinct parts with total sum of parts equal to n. A320793

Numbers n for which abs((-1)^k*∑_k=1..n ((n-k+1) mod k)) = 0. A154586

Number of n X 3 nonnegative integer arrays with upper left 0 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down. A252933

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 721", based on the 5-celled von Neumann neighborhood. A273447

Number of nX5 0..1 arrays with every element equal to 0, 1 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302160

G.f. satisfies A(x) = 1 + x·A(x)² / (1 - x·A(x)³)³. A367281

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 0, 1), (0, 1, 0), (1, 1, -1), (1, 1, 0)}. A151105

T(n,k)=Number of nXk nonnegative integer arrays with upper left 0 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down. A252938

Number of iterations of A174221 (the PrimeLatz map) required to enter a loop, for initial value n, or -1 if this never happens. A293980

Start with 83; if even, divide by 2; if odd, add next three primes: Orbit of 83 under iterations of A174221, the "PrimeLatz" map. A293979