Properties of the Number 34972

Thirty-Four Thousand Nine Hundred Seventy-Two

Basics

Value: 34971 → 34972 → 34973

Parity: even

Prime: No

Previous Prime: 34963

Next Prime: 34981

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 7 × 1249

Divisors: 1, 2, 4, 7, 14, 28, 1249, 2498, 4996, 8743

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000100010011100

Octal: 104234

Duodecimal: 182A4

Hexadecimal: 889c

Square: 1223040784

Square Root: 187.0080212183424

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

Palindromic numbers in bases 3 and 6 written in base 10. A259375

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A384650. A384654

Number of n X n 0..2 symmetric matrices with every element equal to zero, one, three or four horizontal and vertical neighbors, and new values 0..2 introduced in lower triangle row major order. A210909

The 3 X 3 X ... X 3 dots problem (3, n times): minimal number of straight lines (connected at their endpoints) required to pass through 3ⁿ dots arranged in a 3 X 3 X ... X 3 grid. A261547

a(n) = floor(T_n+1/T_n) where T_n is n-th tangential or "Zag" number (see A000182). A34972

The nⁿ dots problem: minimal number of straight lines (connected at their endpoints) required to pass through nⁿ dots arranged in an n X n X ... X n grid. A318165

Minimal number of straight lines of a covering tree needed to cover n X n X n points arranged in a 3-D grid. A319259