Properties of the Number 39708

Thirty-Nine Thousand Seven Hundred Eight

Basics

Value: 39707 → 39708 → 39709

Parity: even

Prime: No

Previous Prime: 39703

Next Prime: 39709

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 1103

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 1103

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001101100011100

Octal: 115434

Duodecimal: 1AB90

Hexadecimal: 9b1c

Square: 1576725264

Square Root: 199.2686628649874

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

Irregular table read by rows: The number of k-faced polyhedra, where k>=4, created when an n-prism, formed from two n-sided regular polygons joined by n adjacent rectangles, is internally cut by all the planes defined by any three of its vertices. A338801

Number T(n,k) of colored compositions of n using all colors of a k-set such that all parts have different color patterns and the patterns for parts i are sorted and have i colors (in arbitrary order); triangle T(n,k), n>=0, 0<=k<=n, read by rows. A327673

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. 1/(1 + k·log(1 - x)). A320079

Array of basis permutations, seen as a triangle read by rows: Row k (k >= 0) gives the values of b(n, k) = number of permutations of size n (2 <= n <= 2(k+1)) in the permutation basis B(k) (see Comments for further details). A265163

Expansion of (1-x)/(1-x+x²+2·x³). A78017

Ratio of the sum of the bends of the 5-dimensional spheres added in the n-th generation of Apollonian packing to the sum of the bends of the initial configuration of seven mutually tangent spheres. A154635

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 1, -1), (1, -1, 1), (1, 0, 1)}. A149035

a(n) = min{m: ∑_x=0..m binomial(n,x) >= 0.95·2ⁿ}. A39708