Properties of the Number -12201

Twelve Thousand Two Hundred One

Basics

Value: -12202 → -12201 → -12200

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 ² × 83

Divisors: 1, 3, 7, 21, 49, 83, 147, 249, 581, 1743

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111110101001

Octal: -27651

Duodecimal: -7089

Hexadecimal: -2fa9

Square: 148864401

Square Root: 110.4581368664165

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

Antidiagonal-sums of the array A377046(n,k) = n-th term of k-th differences of nonsquarefree numbers (A013929). A377047

Sum of 5th powers: 0⁵ + 1⁵ + 2⁵ + ... + n⁵. A539

Sum of the (n-1)-th powers of the first n integers. A76015

Sum of the fifth powers of the parts in the partitions of n into two parts. A294272

a(n) = 1ⁿ + 2ⁿ + ... + 6ⁿ. A1553

Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i. A56219

Smallest multiple of n with digit sum = 6, or 0 if no such number exists, e.g. a(9k)= 0. A69525

Sum of the fifth powers of the parts in the partitions of n into two distinct parts. A294300

Partial sums of A255744. A255765

Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = ∑_{j=1..n, gcd(n,j) = 1} j^k. A308477