Properties of the Number -353522

Three Hundred Fifty-Three Thousand Five Hundred Twenty-Two

Basics

Value: -353523 → -353522 → -353521

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 13 × 13597

Divisors: 1, 2, 13, 26, 13597, 27194, 176761, 353522

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010110010011110010

Octal: -1262362

Duodecimal: -150702

Hexadecimal: -564f2

Square: 124977804484

Square Root: 594.5771606780738

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

Bessel polynomial y_n(x) evaluated at x=1. A1515

a(0) = a(1) = 1; thereafter a(n) = (2·n-3)*a(n-1) + a(n-2). A144301

Square array read by antidiagonals upwards: T(n,k) is the number of scenarios for the gift exchange problem in which each gift can be stolen at most once, when there are n gifts in the pool and k gifts (not yet frozen) in peoples' hands. A144502

Triangle read by rows: coefficients of polynomials arising from the recurrence A[n](x) = A[n-1]'(x)/(1-x) with A[0] = exp(x). A144505

Array T(n,k) (n >= 1, k >= 0) read by downwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., i] into exactly k nonempty blocks, each of size at most n, for any i in the range n <= i <= k·n. A144510

Array read by upwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., k+1, for 0 <= k <= (k+1)*n. A144512

Matrix inverse of A100862. A107102