Properties of the Number -38873

Thirty-Eight Thousand Eight Hundred Seventy-Three

Basics

Value: -38874 → -38873 → -38872

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 38873

Divisors: 1, 38873

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001011111011001

Octal: -113731

Duodecimal: -1A5B5

Hexadecimal: -97d9

Square: 1511110129

Square Root: 197.1623696347759

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

a(n) = prime(2ⁿ). A33844

Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity). A355732

a(0)=1, a(n) = prime(n³). A55875

Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = ∑_k>=0 y^k * R_k(y)^n·k for n>=0, with R₀(y) = 1/(1-y). A124530

Row 1 of rectangular table A124530. A124531

Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = [ ∑_k>=0 y^k * R_k(y)ⁿ ]ⁿ for n>=0, with R₀(y) = 1. A124540

Replace prime(k) with prime(2^k) in the prime factorization of n. A353397

Primes having only {3, 7, 8} as digits. A260381

a(n) = prime(4ⁿ). A119772

a(n) = A122111(A225546(n)). A336321