Properties of the Number -16190

Sixteen Thousand One Hundred Ninety

Basics

Value: -16191 → -16190 → -16189

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 1619

Divisors: 1, 2, 5, 10, 1619, 3238, 8095, 16190

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11111100111110

Octal: -37476

Duodecimal: -9452

Hexadecimal: -3f3e

Square: 262116100

Square Root: 127.23993083933989

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

Triangles in open triangular matchstick arrangement (triangle minus one side) of side n. A45947

Limit of number of compositions (ordered partitions) of m into distinct parts where largest part is exactly m-n, for m sufficiently large given n. A72576

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

a(n) = n*(4·n² + n - 1)/2. A125200

G.f.: ∑_n>=0 (n+1) * xⁿ * (1 + xⁿ)ⁿ / (1 + xⁿ⁺¹)ⁿ⁺². A326285

Expansion of (1/x) * Series_Reversion( x / ( (1+x)² * (1+2·x)³ ) ). A379546

Numbers k such that k and k² use only the digits 0, 1, 2, 6 and 9. A136830

Sum of the next to smallest parts in the partitions of 4n into 4 parts with smallest part = 1. A239195

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), (-1, 1, -1), (1, -1, 0), (1, 0, 1)}. A148122