Properties of the Number -24530

Twenty-Four Thousand Five Hundred Thirty

Basics

Value: -24531 → -24530 → -24529

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 11 × 223

Divisors: 1, 2, 5, 10, 11, 22, 55, 110, 223, 446

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101111111010010

Octal: -57722

Duodecimal: -12242

Hexadecimal: -5fd2

Square: 601720900

Square Root: 156.62056059151365

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 k such that k and k+1 are the product of exactly four distinct primes. A318896

a(1)=1, a(n) = a(n-1) + n⁴ if n odd, a(n) = a(n-1) + n² if n is even. A140159

a(n) is the Wiener index of a broom on 2n vertices of which n+2 are pendant. A349416

Numbers k such that A360327(k) = A360327(k+1) > 1. A360358

Sum of the first n safe primes. A66869

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 427", based on the 5-celled von Neumann neighborhood. A271904

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A001950 (upper Wythoff sequence). A24465

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A001950 (upper Wythoff sequence). A25085

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, 1), (1, -1, 1), (1, 1, 0)}. A150200