Properties of the Number -23659

Twenty-Three Thousand Six Hundred Fifty-Nine

Basics

Value: -23660 → -23659 → -23658

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 59 × 401

Divisors: 1, 59, 401, 23659

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101110001101011

Octal: -56153

Duodecimal: -11837

Hexadecimal: -5c6b

Square: 559748281

Square Root: 153.81482373295495

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

Consider all ways of writing a number as p+2m² where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number. A16067

G.f.: ∑_n>=0 ∏_k=1..n ((1+x)^2·k-1 - 1)/(1 - x^2·k-1). A207654

Shifts left when Euler transform applied 8 times. A144040

a(n) = 729·n² - 442·n + 67. A157668

Expansion of x(2 + 5x - x²)/((1 - x)(1 - 6x + x²)). A82291

a(n) = 676·n - 1. A158393

Row sums of A181657. A181658

a(n) = (3·b(n) + b(n-1) + 1)/2, where b = A005409. A328990

Smallest integer that can be expressed as p+2m² in more ways than any smaller number, where m >= 0 and p = 1 or prime. A55202

Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k returns (i.e., down steps hitting the x-axis). A97612