Properties of the Number -151200

One Hundred Fifty-One Thousand Two Hundred

Basics

Value: -151201 → -151200 → -151199

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ³ × 5 ² × 7

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100100111010100000

Octal: -447240

Duodecimal: -73600

Hexadecimal: -24ea0

Square: 22861440000

Square Root: 388.84444190447164

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 read by rows: T(n,k) = ∑_j=0..k (-1)^j * binomial(k,j) * (2-j)ⁿ. A391068

Bi-diagonal inverse of [k<=n]*n!/(2k)!. A119836

Triangle: p(x) = (t/log(1 + t))^a0*(1 + t)^x; a0=2; weights (n+1)!*n!. A137381

Triangular sequence of coefficients of p(x,t) = t·exp(3·x*t - t²)/(exp(t) - 1). A137784

a(n) = n!/24. A1720

Triangle read by rows: T(n, k) = n! / k!, 1 <= k <= n. A173333

Triangle of falling factorials, read by rows: T(n, k) = n*(n-1)*...*(n-k+1), n > 0, 1 <= k <= n. A68424

a(n) = ∏_k=1..n rad(k), where rad(n) is the product of distinct prime factors of n, cf. A007947. A48803

Number T(n,k) of n-length words w over a k-ary alphabet {a1, a2, ..., ak} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 1, where #(w,x) counts the letters·in word w; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. A226874

Triangle read by rows: the Bell transform of the triple factorial numbers A008544 without column 0. A4747