Properties of the Number -39697

Thirty-Nine Thousand Six Hundred Ninety-Seven

Basics

Value: -39698 → -39697 → -39696

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 7 × 53 × 107

Divisors: 1, 7, 53, 107, 371, 749, 5671, 39697

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001101100010001

Octal: -115421

Duodecimal: -1AB81

Hexadecimal: -9b11

Square: 1575851809

Square Root: 199.24106002528697

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 whose sum of divisors is a sixth power. A19424

Numbers whose sum of divisors is 6⁶ = 46656. A48256

a(n) = ∑_k=0..n (-1)^k * (k+1) * binomial(4·n-3·k+1,n-k)/(4·n-3·k+1). A387982

E.g.f. tan(cos(x)*x) (odd powers only). A9633

Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n. A175760

Number of binary rooted trees with n nodes and height at most 6. A36589

a(n) is the (2n)-th term of the n-fold self-convolution of the Euler totient function φ. A340994

Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows, where T(n,k) = ∑_j=k..n 2^n-j * Stirling2(n,j) * Stirling2(j,k). A383206

Numbers n with ω(n) = ω of 3 nearest larger and 3 nearest smaller neighbors. A101936

Number of (n+1) X 6 0..2 arrays with all 2 X 2 subblock sums the same. A183999