Properties of the Number -105621

One Hundred Five Thousand Six Hundred Twenty-One

Basics

Value: -105622 → -105621 → -105620

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 17 × 19 × 109

Divisors: 1, 3, 17, 19, 51, 57, 109, 323, 327, 969

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11001110010010101

Octal: -316225

Duodecimal: -51159

Hexadecimal: -19c95

Square: 11155795641

Square Root: 324.99384609558376

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

Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows. A154227

Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives sum of n-th group. A74124

a(n) = 16n⁴ + 64n³ + 104n² + 80n + 21. A176711

a(n) = 100·n² + 100·n + 21. A152161

From George Gilbert's marks problem: jumping 6 marks at a time (final positions). A19996

Distinct odd elements in 4-Pascal triangle A028275 (by row). A28281

Odd elements (greater than 1) to right of central elements in 4-Pascal triangle A028275. A28287

Triangle read by rows: t(n,m)=(1 + n!)*Binomial[n, m]-n!/Binomial[n, m]. A144397