Properties of the Number 40339

Forty Thousand Three Hundred Thirty-Nine

Basics

Value: 40338 → 40339 → 40340

Parity: odd

Prime: No

Previous Prime: 40289

Next Prime: 40343

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 × 29 × 107

Divisors: 1, 13, 29, 107, 377, 1391, 3103, 40339

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001110110010011

Octal: 116623

Duodecimal: 1B417

Hexadecimal: 9d93

Square: 1627234921

Square Root: 200.84571192833567

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

Numbers n for which there are exactly six k such that n = k + (product of nonzero digits of k). A96927

a(n) = prime(n) + n!. A121926

a(n) is the Wiener index of a broom on 2n vertices of which n+2 are pendant. A349416

Numbers of the form prime(n) + n! such that γ(n) + prime(n) is prime. A104079

Sum of n and the sum of the factorials of its digits. A241404

Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock sum of the two medians of the central row and column plus the two sums of the diagonal and antidiagonal nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A259004

a(1)=0; a(n+1) = a(n) - gpf(n) if a(n) >= gpf(n), otherwise a(n+1) = a(n) + lpf(n), where gpf(n) is the greatest prime dividing n (A006530) and lpf(n) is the least prime dividing n (A020639). A248820

Continued fraction for sqrt(358). A40339