Properties of the Number -95326

Ninety-Five Thousand Three Hundred Twenty-Six

Basics

Value: -95327 → -95326 → -95325

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 × 11 × 619

Divisors: 1, 2, 7, 11, 14, 22, 77, 154, 619, 1238

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10111010001011110

Octal: -272136

Duodecimal: -471BA

Hexadecimal: -1745e

Square: 9087046276

Square Root: 308.7490890674821

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) is the number of distinct (infinite) output sequences from binary n-stage shift register which feeds back the complement of the last stage. A16

a(n) = ceiling(2^n-1/n). A53637

a(n) is the index of the smallest n-gonal number with exactly n prime factors (counted with multiplicity). A359014

Number of subsets of {1,2,3,...,n} that sum to 0 mod 11. A68032

Number of frieze patterns of length n under a certain group (see Pisanski et al. for precise definition). A123046

Integers k such that 10^k+57 is a prime number. A135119

Numbers n such that 41#*2ⁿ-1 is prime, where # denotes the primorial, A002110. A176061

Number of (n+3) X (1+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits. A262236

a(n) = A000016(2·n). A300668

Number of nX5 0..1 arrays with every element unequal to 0, 1, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero. A316549