Properties of the Number 1189

One Thousand One Hundred Eighty-Nine

Basics

Value: 1188 → 1189 → 1190

Parity: odd

Prime: No

Previous Prime: 1187

Next Prime: 1193

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 29 × 41

Divisors: 1, 29, 41, 1189

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10010100101

Octal: 2245

Duodecimal: 831

Hexadecimal: 4a5

Square: 1413721

Square Root: 34.48187929913333

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(n)² is a triangular number: a(n) = 6·a(n-1) - a(n-2) with a(0)=0, a(1)=1. A1109

a(n) = n + (n+1)². A28387

a(n) = 3·a(n-1) + a(n-2), with a(0)=0, a(1)=1. A6190

Numbers k that divide the (left) concatenation of all numbers <= k written in base 2 (most significant digit on left). A29471

Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate. A960

Table by antidiagonals of T(n,k) = n·T(n,k-1) + T(n,k-2) starting with T(n,1) = 1. A73133

Array A(n,k) = n·A(n,k-1) + A(n,k-2) read by upward antidiagonals, starting A(n,0) = 0, A(n,1) = 1. A172236

Array read by ascending antidiagonals. A(n, k) = Fibonacci(k, n), where Fibonacci(n, x) are the Fibonacci polynomials. A352361

Total number of ON states after n generations of cellular automaton based on hexagons. A151723

Array A(n, k) = Fibonacci(n+1, k), with A(n, 0) = A(n, n) = 1, read by antidiagonals. A157103