Properties of the Number 34872

Thirty-Four Thousand Eight Hundred Seventy-Two

Basics

Value: 34871 → 34872 → 34873

Parity: even

Prime: No

Previous Prime: 34871

Next Prime: 34877

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 1453

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 1453, 2906

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000100000111000

Octal: 104070

Duodecimal: 18220

Hexadecimal: 8838

Square: 1216056384

Square Root: 186.7404616037992

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

T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s. A297682

Number of linear arrangements of n blue, n red and n green items such that there are no adjacent items of the same color (first and last elements considered as adjacent). A110707

T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in 0..i and no value appearing more than k times. A248842

Matrix square of triangle A063967. A91700

Number of physical trees of alkane structures with n carbon vertices. A135106

Number of length n arrays x(i), i=1..n with x(i) in 0..i and no value appearing more than 3 times. A248837

Column 0 of triangle A091700. A91702

Arises in covering a graph by forests and a matching. A179259

T(n,k) = number of circular arrays of n 1's, n -1's, and k 0's such that no two adjacent elements are equal. A283614

Number of nX4 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s. A297678