Properties of the Number -23410

Twenty-Three Thousand Four Hundred Ten

Basics

Value: -23411 → -23410 → -23409

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 2341

Divisors: 1, 2, 5, 10, 2341, 4682, 11705, 23410

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101101101110010

Octal: -55562

Duodecimal: -1166A

Hexadecimal: -5b72

Square: 548028100

Square Root: 153.00326793895613

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

Central coefficients of number triangle A113582. A154323

a(n) = number of 8-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..71]. A178879

Numbers k such that replacing each nonzero digit d with the d-th prime (replacing each 0 digit with a 1) yields a square. A48383

Number of Dyck n-paths all of whose ascents and descents have lengths equal to 1 (mod 6). A212365

Numbers whose square is a fourth power plus a prime. A236767

Numbers d > 1 such that the class number of Q(sqrt(d)) is strictly greater than the class number of Q(sqrt(m)) for all m < d. A283658

Let an integer with k+1 digits as n = d(k)*10^k + d(k-1)*10^k-1 + ... + d(0)*10⁰ and consider the transform T(n) = k·10^d(k) + (k-1)*10^d(k-1) + ... + 0·10^d(0). a(n) gives the fixed points of the transform T(n). A226767

Fibonacci with binary selection. A327665

G.f. satisfies A(x) = A(x³)/(A(x²) - A(x³)), with A(0) = 0, A'(0) = 1. A382317