Properties of the Number -39353

Thirty-Nine Thousand Three Hundred Fifty-Three

Basics

Value: -39354 → -39353 → -39352

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 23 × 29 × 59

Divisors: 1, 23, 29, 59, 667, 1357, 1711, 39353

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001100110111001

Octal: -114671

Duodecimal: -1A935

Hexadecimal: -99b9

Square: 1548658609

Square Root: 198.37590579503347

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

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2·k+1 if k <= floor(n/2) otherwise 2*(n-k)+1, and m = 2, read by rows. A157273

Numbers k such that 4^k + 25 is prime. A204388

Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k returns to the horizontal axis (i.e., (1,-1)-steps ending on the horizontal axis). The members of B(n) are paths of weight n that start in (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: a (1,0)-step with weight 1; a (1,0)-step with weight 2; a (1,1)-step with weight 2; a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A246179