Properties of the Number -234061

Two Hundred Thirty-Four Thousand Sixty-One

Basics

Value: -234062 → -234061 → -234060

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 19 × 97 × 127

Divisors: 1, 19, 97, 127, 1843, 2413, 12319, 234061

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111001001001001101

Octal: -711115

Duodecimal: -B3551

Hexadecimal: -3924d

Square: 54784551721

Square Root: 483.798511779439

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

Let f(0) = 0, f(1) = 1 and for n > 1 let f(n) = (-1)*sum((-1)^n+r*f(r),r=0..n-2)/(n*(n-1)); sequence gives numerator of f(n). A90295

a(n) = n·a(n-1) - a(n-2) with a(0) = 0, a(1) = 1. A58798

Triangle read by rows: T(n,k) = number of permutations p of [n] such that max(|p(i)-i|)=k (n>=1, 0<=k<=n-1). A130152

Array (a frieze pattern) defined by a(n,k) = (a(n-1,k)*a(n-1,k+1) - 1) / a(n-2,k+1), read by antidiagonals. A7754

Number of permutations p of [n] such that max_j=1..n |p(j)-j| = 5. A323801

a(0) = 1, a(1) = 2; for k>0, a(2·k) = k·a(2·k-1) + a(2·k-2), a(2·k+1) = a(2·k) + a(2·k-1). A273939

Number of permutations p of [n] such that max_j=1..n |p(j)-j| = floor(n/2). A323807