Properties of the Number -532480

Five Hundred Thirty-Two Thousand Four Hundred Eighty

Basics

Value: -532481 → -532480 → -532479

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ¹³ × 5 × 13

Divisors: 1, 2, 4, 5, 8, 10, 13, 16, 20, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -10000010000000000000

Octal: -2020000

Duodecimal: -218194

Hexadecimal: -82000

Square: 283534950400

Square Root: 729.7122720634483

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..n (n⁶ + k⁶). A367823

Expansion of x*(1 + x)/(1 - 2·x)³. A276289

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 260", based on the 5-celled von Neumann neighborhood. A280373

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 260", based on the 5-celled von Neumann neighborhood. A287285

Median of 2^X + 2^Y where X and Y are independent random variables with B(n,1/2) distributions. A288346

Row sums of triangle A118438. A118440

a(n) = n⁷*(n³ + 1)/2. A168660

Number of permutations of n elements divided by the number of ternary heaps on n+1 elements. A273731

Numbers k such that neither 4 nor 9 divides binomial(2k-1,k) (almost certainly finite). A51404

Define the array k(n,x) = number of m such that τ(gcd(n,m)) is·where m runs from 1 to n. Also define h(n,x) = ∑_{d∣n : τ(d) = x} d. The sequence contains numbers n such that k(n,x)*x = h(n,x) has at least one solution x. A197099