Properties of the Number -15182

Fifteen Thousand One Hundred Eighty-Two

Basics

Value: -15183 → -15182 → -15181

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 7591

Divisors: 1, 2, 7591, 15182

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11101101001110

Octal: -35516

Duodecimal: -8952

Hexadecimal: -3b4e

Square: 230493124

Square Root: 123.2152587953294

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

Low-temperature series for partition function for spin-1/2 Ising model on f.c.c. lattice. A2892

Expansion of 1/(1 - x³ - x⁴ + x⁷ - x¹⁰ - x¹¹ + x¹⁴) (a Salem polynomial). A143644

Number of compositions (ordered partitions) of n into 1's, 2's and 4's. A60945

The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts. A102186

Expansion of 1/(1-x³-x⁴-x⁵). A17818

Expansion of (1-x)^-1/(1+2·x+x²+x³). A77930

a(n) = sum of the first n lower twin primes. A86167

a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2; a(n) = a(n-1) + a(n-2) + a(n-4). A181532

Number of precomplete Post functions of n variables. A2826

a(1) = number of 1-digit primes (that is, 4: 2,3,5,7); then a(n) = number of distinct n-digit prime numbers obtained by left- or right-concatenating a digit to the a(n-1) primes obtained in the previous iteration. A298048