Properties of the Number -159375

One Hundred Fifty-Nine Thousand Three Hundred Seventy-Five

Basics

Value: -159376 → -159375 → -159374

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ⁵ × 17

Divisors: 1, 3, 5, 15, 17, 25, 51, 75, 85, 125

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

375 Try Today's Challenge

Representations

Binary: -100110111010001111

Octal: -467217

Duodecimal: -78293

Hexadecimal: -26e8f

Square: 25400390625

Square Root: 399.2179855667828

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

Numbers j that are the hypotenuse of exactly 16 distinct integer-sided right triangles, i.e., j² can be written as a sum of two squares in 16 ways. A97238

Triangle of coefficients of polynomials (rising powers) useful for convolutions of A000204(n+1), n >= 0 (Lucas numbers). A61189

Composites which use less than all of their digits in their prime factorization. A74211

a(n) = n! * [xⁿ] exp(n·x)*BesselI(0,2·n*x). A294409

a(1) = 1; thereafter a(n+1) > a(n) is the smallest multiple of a(n) using only odd digits but not divisible by 9. A329764

Triangle read by rows: number of spanning trees obtained for an almost-complete bipartite graph by removing k disjoint edges from the complete bipartite graph K n,n with k<=n. A260383