Properties of the Number -84448

Eighty-Four Thousand Four Hundred Forty-Eight

Basics

Value: -84449 → -84448 → -84447

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: Yes

Factorization: 2 ⁵ × 7 × 13 × 29

Divisors: 1, 2, 4, 7, 8, 13, 14, 16, 26, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10100100111100000

Octal: -244740

Duodecimal: -40A54

Hexadecimal: -149e0

Square: 7131464704

Square Root: 290.59938059121873

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) = ∑_{k=0..floor(n/3)} n^k * Stirling1(n,3·k). A356362

a(n) = ∑_m=0..n (∑_k=0..m binomial(n,k))³ = (n+2)*2^3·n-1 - 3·2^n-2*n·binomial(2·n,n). A7403

25-gonal pyramidal numbers: a(n) = n*(n+1)*(23·n-20)/6. A256645

a(1) = 1, a(n) = smallest nontrivial palindromic multiple of a(n-1). a(n) is not equal to a(n-1) or a concatenation of a(n-1) with itself. A83147

a(1) = 1; a(2) = 1; a(n) = prime(a(n-1)) + prime(a(n-2)) if n > 2. A69103

Palindromes with exactly 8 prime factors (counted with multiplicity). A46334

Partial sums of A051880. A50406

a(n) = σ[k](n) - φ(n)^k - d(n)^k for k=3. A79539

E.g.f.: C(x,q) = 1 + Integral S(x,q) * C(q·x,q) dx, such that C(x,q)² - S(x,q)² = 1, where C(x,q) = ∑_n>=0 ∑_{k=0..n*(n-1)/2} T(n,k)*xⁿ*y^k/n!, as an irregular triangle of coefficients T(n,k) read by rows. A322218

Number of compositions of n such that the set of parts and the set of multiplicities of parts are equal. A336031