Properties of the Number -115200

One Hundred Fifteen Thousand Two Hundred

Basics

Value: -115201 → -115200 → -115199

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ⁹ × 3 ² × 5 ²

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -11100001000000000

Octal: -341000

Duodecimal: -56800

Hexadecimal: -1c200

Square: 13271040000

Square Root: 339.4112549695428

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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 read by rows: T(n, m) = S1(n, m)*8^n-m, where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n). A51187

Expansion of f(-x)⁸ * Q(x) in powers of·where f() is a Ramanujan θ function and Q() is a Ramanujan Lambert series. A277076

13-almost primes (generalization of semiprimes). A69274

Transform of n³ by the Riordan array (1/(1-x²), x). A105636

Triangle T(n, k) read by rows. T(n, k) is the number of lists of k unlabeled permutations whose total length is n. A90238

Numbers whose product of prime indices equals their product of prime exponents (prime signature). A353503

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k even entries that are followed by a smaller entry (n>=0, k>=0). A134434

a(n) = (n-1)! + ((n+1)/2)*a(n-1), a(1)=0. A59371

Number of seating arrangements for the ménage problem. A59375

Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that j and p(j) are of opposite parities for k values of j (0<=k<=n). A145893