Properties of the Number 34189

Thirty-Four Thousand One Hundred Eighty-Nine

Basics

Value: 34188 → 34189 → 34190

Parity: odd

Prime: No

Previous Prime: 34183

Next Prime: 34211

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 179 × 191

Divisors: 1, 179, 191, 34189

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010110001101

Octal: 102615

Duodecimal: 17951

Hexadecimal: 858d

Square: 1168887721

Square Root: 184.90267710338864

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

Sequence of pairwise relatively prime numbers of class P₄ (see comment in A275246). A275248

The least number s > 1 having exactly n fives in the periodic part of the continued fraction of sqrt(s). A206585

Start with a square; at each stage add a square at each expandable vertex so that the ratio of the side of the squares at stage n+1 and at stage n is the golden ratio φ=0.618...; a(n) is the number of squares at n-th stage. A269962

a(n) = number of (s(0),s(1),...,s(n)) such that every s(i) is a nonnegative integer, s(0) = 1, s(n) = 2, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-1), where T is the array in A026120; a(n) = U(n,n+1), where U is the array in A026148. A26123

Molien series for group G_1,2⁸ of order 1536. A51462

a(n) = numerator(∑_k=1..n (-1)^k+1/(prime(k)-1)). A128647

a(0)=1, a(n) = least k > a(n-1) such that k·a(n-1) is a triangular number. A213005

Composites in base 10 that remain composite in exactly four bases b, 2 <= b <= 10, expansions interpreted as decimal numbers. A256354

Number of nX2 0..1 arrays with every element unequal to 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero. A304257

a(0)=1, a(1)=1, a(n) = 13·a(n/2) for n=2,4,6,..., a(n) = 12·a((n-1)/2) + a((n+1)/2) for n=3,5,7,.... A116524