Properties of the Number -9595

Five Hundred Ninety-Five

Basics

Value: -9596 → -9595 → -9594

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 19 × 101

Divisors: 1, 5, 19, 95, 101, 505, 1919, 9595

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10010101111011

Octal: -22573

Duodecimal: -5677

Hexadecimal: -257b

Square: 92064025

Square Root: 97.95407086997457

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) = 1·2*3 + 4·5*6 + 7·8*9 + 10·11·12 + 13·14·15 + 16·17·18 + ... + (up to n). A319014

Number of integer partitions of n with fewer parts than distinct divisors of parts. A371173

a(n) = ∑_d∣n φ(d³). A68963

Number of terms in 5th derivative of a function composed with itself n times. A22815

Schoenheim bound L₁(n,5,4). A36832

Sums of 7 distinct powers of 3. A38469

a(n) = number of partitions of n into an odd number of parts, the least being 2; also a(n+2) = number of partitions of n into an even number of parts, each >=2. A27188

a(n) = A007318 * [1, 6, 14, 9, 0, 0, 0, ...]. A143690

Integer nearest to (F[2n+1](S(n)))², where F[2n+1](x) are Fibonacci polynomials of odd indices [2n+1] and S(n) = ∑_i=0..2 (C(i)*(log(log(A*(B+n²))))²ⁱ) (see coefficients A, B, C(i) in comments). A227693

Number of 6 X 6 binary matrices with n=0...36 ones up to row and column permutations. A52370