Properties of the Number -34988

Thirty-Four Thousand Nine Hundred Eighty-Eight

Basics

Value: -34989 → -34988 → -34987

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 8747

Divisors: 1, 2, 4, 8747, 17494, 34988

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000100010101100

Octal: -104254

Duodecimal: -182B8

Hexadecimal: -88ac

Square: 1224160144

Square Root: 187.05079524022347

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

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having its minimum diagonal element less than its minimum antidiagonal element. A250965

Partial sums of ∑_k=1..n n/gcd(n,k), or partial sums of ∑_d∣n d*φ(d) (see A057660). A174405

G.f.: A(x) = ∑_n>=0 x^n*(n+1/2) / ∏_k=1..n (1-x^k)^k. A206138

Largest integer with sum of digits n in fractional base 4/3. A364779

Expansion of series related to Liouville's Last Theorem: g.f. ∑_t>0 (-1)^t+1 *x^t*(t+1/2) / ( (1-x^t)⁴ *∏_i=1..t (1-xⁱ) ). A59821

Number of binary strings of length n with equal numbers of 00001 and 01100 substrings. A164201

Number of (n+1)X(n+1) 0..3 arrays with no 2X2 subblock having its minimum diagonal element less than its minimum antidiagonal element. A250957

Number of (n+1)X(2+1) 0..3 arrays with no 2X2 subblock having its minimum diagonal element less than its minimum antidiagonal element. A250959

Numbers n such that σ(n) = φ(n) + φ(n-1) + φ(n-2). A67202