Properties of the Number -15147

Fifteen Thousand One Hundred Forty-Seven

Basics

Value: -15148 → -15147 → -15146

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 11 × 17

Divisors: 1, 3, 9, 11, 17, 27, 33, 51, 81, 99

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -11101100101011

Octal: -35453

Duodecimal: -8923

Hexadecimal: -3b2b

Square: 229431609

Square Root: 123.07314898059609

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

a(n) = n*(14·n-3). A185019

Smallest number having exactly n divisors of the form 8·k + 3. A343105

a(n) is the number of distinct solution sets to the quadratic equations u·x² + v·x + w = 0 with integer coefficients u, v, w, abs(u) + abs(v) + abs(w) <= n having a negative discriminant. A381710

Smallest number having exactly n divisors of the form 8·k + 1. A343104

Numbers m such that 20·m + 1, 80·m + 1, 100·m + 1, and 200·m + 1 are all primes. A372186

Row sums of partition triangle A026820. A58397

a(n) = [xⁿ] ∏_k>=1 ((1 + x^k)/(1 + x^n·k))ⁿ. A304626

Triangular array: the fission of (p(n,x)) by (q(n,x)), where p(n,x)=sum{F(k+1)*x^n-k : 0<=k<=n}, where F=A000045 (Fibonacci numbers) and q(n,x)=(x+1)ⁿ. A193997

Mirror of the triangle A193997. A193998

Smallest number expressible in the form a² + 2b², with positive integers a and b, in exactly n ways. A200977