Properties of the Number 61596

Sixty-One Thousand Five Hundred Ninety-Six

Basics

Value: 61595 → 61596 → 61597

Parity: even

Prime: No

Previous Prime: 61583

Next Prime: 61603

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 29 × 59

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 29, 36

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1111000010011100

Octal: 170234

Duodecimal: 2B790

Hexadecimal: f09c

Square: 3794067216

Square Root: 248.1854145593572

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

For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of u²+v². A345434

Square array read by antidiagonals: T(n,k)=T(n,k-1)*n²/(n-1)-Catalan(k-1) with a(n,1)=n-1 and a(1,k)=0 where Catalan(k)=C(2k,k)/(k+1)=A000108(k). A67346

Expansion of (1+sqrt(1-4x))/(4sqrt(1-4x)-2). A104530

a(n) = 81·n² - 69·n + 24. A304616

Number of (binary) max-heaps on n elements from the set {0,1} containing exactly eight 0's. A326509

Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having three distinct values for every i<=n and j<=n. A211459

Number of permutations of length n which avoid the patterns 1342, 3214, 4312. A116808

Product of digits + 1 is prime, product of digits - 1 is prime, sum of digits + 1 is prime and sum of digits - 1 is prime. A61596