Properties of the Number 39917

Thirty-Nine Thousand Nine Hundred Seventeen

Basics

Value: 39916 → 39917 → 39918

Parity: odd

Prime: No

Previous Prime: 39901

Next Prime: 39929

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 179 × 223

Divisors: 1, 179, 223, 39917

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001101111101101

Octal: 115755

Duodecimal: 1B125

Hexadecimal: 9bed

Square: 1593366889

Square Root: 199.7923922475528

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 integer partitions whose sum of primes of parts equals their sum of parts plus n. A331387

Largest number·such that sum of divisors of·is n!. A55489

Composite numbers not divisible by 2, 3, 5 or 7 which in base 2 contain their largest proper factor as a substring. A63138

Numbers k such that σ(k) = σ(k - d(k)). A277273

Smallest composite number in base n which contains its largest proper factor as a substring. A63248

Least composite number not congruent to 0 (modulo the first n primes) which contains its greatest proper divisor as a substring of itself, both in base two. A77658

Consider the graph whose vertices are the points of the n-dimensional cubic lattice with points connected by all integer-length diagonals that traverse all n dimensions and do not intersect intermediate points. a(n) is the total length of the shortest possible closed walk in this graph via noncongruent diagonals of the same length. A385525

All integers k that can produce a closed walk in a square lattice via noncongruent primitive k-length hypotenuses, in ascending order. A386671

Number of orderings of 1,2,...,n² in an n X n matrix such that each row, each column and both diagonals are increasing. A39917