Properties of the Number -103200

One Hundred Three Thousand Two Hundred

Basics

Value: -103201 → -103200 → -103199

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 2 ⁵ × 3 × 5 ² × 43

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11001001100100000

Octal: -311440

Duodecimal: -4B880

Hexadecimal: -19320

Square: 10650240000

Square Root: 321.2475680841802

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

Expansion of ∏_k>=1 (1 - k·x^k) / (1 + x^k). A269339

Given M = triangle A122196 as an infinite lower triangular matrix, this sequence is lim_k->infinity M^k. A171238

Largest achievable determinant of a 4 X 4 matrix whose elements are the 16 consecutive integers n-15,...,n. A97696

5-Smith numbers. A103126

Positive numbers k such that k and 3·k are anagrams in base 5 (written in base 5). A23062

Number of 3 X n 0..2 arrays with no element equal to any value at offset (-2,0) (-1,2) or (0,-2) and new values introduced in order 0..2. A275566

a(n) = N^1/4 * log(N) / sqrt(log(log(N))) rounded to nearest integer, with N=10ⁿ. Related to operation count of the deterministic factorization of an integer N using an improved Pollard-Strassen method. A309917

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (1, 0, -1), (1, 0, 1), (1, 1, 1)}. A151028

Triangle read by rows: T(n,k) is the coefficient of (1+x)^k in the ZZ polynomial of the hexagonal graphene flake O(3,4,n). A338259