Properties of the Number -38798

Thirty-Eight Thousand Seven Hundred Ninety-Eight

Basics

Value: -38799 → -38798 → -38797

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 35

Digital Root: 8

Palindrome: No

Factorization: 2 × 19 × 1021

Divisors: 1, 2, 19, 38, 1021, 2042, 19399, 38798

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001011110001110

Octal: -113616

Duodecimal: -1A552

Hexadecimal: -978e

Square: 1505284804

Square Root: 196.97207923967295

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 free poly-IH8-tiles (holes allowed) with n cells. A197550

G.f. A(x) satisfies A(x) = 1 + x·A(x)⁴ * A(x·A(x)⁴)⁴. A120975

a(n) = ∑_k=1..n k^floor(n/k). A345100

Number of (w,x,y) with all terms in {0,...,n} and 2*|w-x| > max(w,x,y) - min(w,x,y). A213045

In base 3: smallest number that requires n Reverse and Add! steps to reach a palindrome. A77403

Number of weighted lattice paths in L_n having no (1,0)-steps at level 0. The members of L_n are paths of weight n that start at (0,0), end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A182889

Right border of A348575. A349742

Number of free poly-IH9-tiles (holes allowed) with n cells. A213950