Properties of the Number 76591

Seventy-Six Thousand Five Hundred Ninety-One

Basics

Value: 76590 → 76591 → 76592

Parity: odd

Prime: No

Previous Prime: 76579

Next Prime: 76597

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 191 × 401

Divisors: 1, 191, 401, 76591

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010101100101111

Octal: 225457

Duodecimal: 383A7

Hexadecimal: 12b2f

Square: 5866181281

Square Root: 276.75079042344214

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 pairs (y, v), where y is a partition of n and v is a sub-multiset of y whose cardinality equals the number of distinct parts in y. A355383

Strong pseudoprimes to base 39. A20265

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (0, 0, 1), (1, 0, -1), (1, 1, 0)}. A150186

Permanent of the (0,1)-matrix with ij-th entry equal to zero iff (i=1,j=1),(i=1,j=2),(i=1,j=3),(i=2,j=3),(i=3,j=3),... In other words, the ij-th entry of the matrix is zero iff it is on the path which start from the entry (i=1,j=1) and moves in the matrix alternating 3 steps to the right to 3 steps down. A98926

a(1)=1, a(2)=2 a(n)=a(n-1)+(a(n-2) mod n). A76591