Properties of the Number 39472

Thirty-Nine Thousand Four Hundred Seventy-Two

Basics

Value: 39471 → 39472 → 39473

Parity: even

Prime: No

Previous Prime: 39461

Next Prime: 39499

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 2467

Divisors: 1, 2, 4, 8, 16, 2467, 4934, 9868, 19736, 39472

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001101000110000

Octal: 115060

Duodecimal: 1AA14

Hexadecimal: 9a30

Square: 1558038784

Square Root: 198.6756150110023

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

Divide the terms of the harmonic series into groups sequentially so that the sum of each group is minimally greater than 1. a(n) is the number of terms in the n-th group. A331030

Number of binary strings of length n with equal numbers of 00000 and 00100 substrings. A164181

Number of (2+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction. A250879

Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0. A267337

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 461", based on the 5-celled von Neumann neighborhood. A272293

Expansion of a modular function for gamma₀(6). A6708

Numbers k such that 149·2^k-1 is prime. A50616

Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any north, west or northeast neighbors modulo n and the upper left element equal to 0. A267393

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0. A267338

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north, west or northeast neighbors modulo n and the upper left element equal to 0. A267392