Properties of the Number -23065

Twenty-Three Thousand Sixty-Five

Basics

Value: -23066 → -23065 → -23064

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 7 × 659

Divisors: 1, 5, 7, 35, 659, 3295, 4613, 23065

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101101000011001

Octal: -55031

Duodecimal: -11421

Hexadecimal: -5a19

Square: 531994225

Square Root: 151.87165634179408

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) = (-n⁵ + 15·n⁴ - 65·n³ + 125·n² - 34·n + 40)/40. A161713

Number of partitions of n² into distinct squares. A30273

a(n) = 2nd elementary symmetric function of the first n+1 odd positive integers. A24196

Consecutive states of the linear congruential pseudo-random number generator 259·s mod 2¹⁵ when started at s=1. A384194

Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-10) in that order. A88871

a(n) = 24·n² + 1. A158547

a(n) = number of isogeny classes of abelian surfaces over the finite field of order prime(n). A362198

Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0. A96554

a(n) = 961·n + 1. A158414

G.f.: exp( ∑_n>=1 σ(n)*A002203(n)*xⁿ/n ) where A002203 is the companion Pell numbers. A203534