Properties of the Number -23481

Twenty-Three Thousand Four Hundred Eighty-One

Basics

Value: -23482 → -23481 → -23480

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 2609

Divisors: 1, 3, 9, 2609, 7827, 23481

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101101110111001

Octal: -55671

Duodecimal: -11709

Hexadecimal: -5bb9

Square: 551357361

Square Root: 153.2351134694656

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

Solution to the non-squashing boxes problem (version 1). A89054

Odd composites k such that σ(k) has the same powerful part as k, where σ is the sum of divisors function. A386425

Terms k of A228058 such that gcd(k - A048250(k), A162296(k) - k) = A162296(k) - k. A325376

a(n) = (p-1)! mod p² where p = n-th prime. A112660

Totally multiplicative sequence with a(p) = a(p-1) + 8 for prime p. A166705

Numbers k such that π(k) = sopf(k) where sopf(k) is sum of distinct prime factors of k (A008472). A64444

Numbers n whose sum of divisors and number of divisors are both triangular numbers. A70996

Numbers n such that 2·10ⁿ + 4·R_n + 3 is prime, where R_n = 11...1 is the repunit (A002275) of length n. A102954

Number of (n+2) X (5+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 3 5 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 3 5 6 or 7. A252251

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