Properties of the Number 34272

Thirty-Four Thousand Two Hundred Seventy-Two

Basics

Value: 34271 → 34272 → 34273

Parity: even

Prime: No

Previous Prime: 34267

Next Prime: 34273

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ² × 7 × 17

Divisors: 1, 2, 3, 4, 6, 7, 8, 9, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010111100000

Octal: 102740

Duodecimal: 17A00

Hexadecimal: 85e0

Square: 1174569984

Square Root: 185.12698344649814

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 6-ary Lyndon words of length n with trace 0 and subtrace 4 over Z₆. A74426

Number of 6-ary Lyndon words of length n with trace 3 and subtrace 4 over Z₆. A74444

a(n) is the concatenation of n and 8n. A9470

T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor, with no occupancy greater than 2. A221200

a(n) = (n-3)*(n-2)*(n-1)*n*(n+1)/30. A210569

Consider the e.g.f. B(x,y) = ∑_n>=0 ∑_{k=0..floor(n/2)} T(n,k) * x^2·n-2·k * y^2·k / (2·n)! and related functions A(x,y) and C(x,y), as defined in the Formula section. Sequence gives the triangular array of coefficients T(n,k) (n>=0, 0<=k<=floor(n/2)) of B(x,y). A326798

a(n) is the smallest number m with exactly n divisors that are Zuckerman numbers, or -1 if there is no such m. A335038

T(n, k) = ∑_j=0..k binomial(n, k - j)*Stirling2(n - k + j, j). Triangle read by rows, 0 <= k <= n. A340264

Number of triple-crossings of diagonals in the regular 2n-gon. A260417

a(n) is the least number with exactly n divisors of the form 5·k+2. A364598