Properties of the Number -95772

Ninety-Five Thousand Seven Hundred Seventy-Two

Basics

Value: -95773 → -95772 → -95771

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 23 × 347

Divisors: 1, 2, 3, 4, 6, 12, 23, 46, 69, 92

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10111011000011100

Octal: -273034

Duodecimal: -47510

Hexadecimal: -1761c

Square: 9172275984

Square Root: 309.47051555842927

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

Number of ways to arrange integers 1 through n so that the sum of each adjacent pair is prime, not counting reversals. A51239

Number of ways of writing the numbers 1 .. n in a sequence so that the sum of any two adjacent numbers is a prime; reversing the sequence does not count as different. A64821

a(n) is the number of essentially different ways in which the integers 1,2,3,...,n can be arranged in a sequence such that all pairs of adjacent integers sum to a prime number. Rotations and reversals are counted only once. A73452

a(n) = 13 + floor(∑_j=1..n-1 a(j)/2). A120140

Expansion of ∏_k>=1 1/(1-x^k)^k+(-1^k). A258386

Expansion of -x*(x⁶+3·x⁵+2·x⁴-2·x³-4·x²+4·x-1)/((1-x)²*(1-2·x-x²)²). A111109

Number of permutations of 2 copies of 1..n with no element e[i>=2]<e[1+floor((i-2)/2)] (2-way heap). A178012