Properties of the Number -15255

Fifteen Thousand Two Hundred Fifty-Five

Basics

Value: -15256 → -15255 → -15254

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 113

Divisors: 1, 3, 5, 9, 15, 27, 45, 113, 135, 339

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11101110010111

Octal: -35627

Duodecimal: -89B3

Hexadecimal: -3b97

Square: 232715025

Square Root: 123.51113310143342

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

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

T(n,k)=Unchanging value maps: number of nXk binary arrays indicating the locations of corresponding elements unequal to no horizontal, diagonal or antidiagonal neighbor in a random 0..2 nXk array. A219142

a(n) = ∑_k=1..n k*φ(k). A11755

T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, diagonal or antidiagonal neighbor in a random 0..1 nXk array. A219441

One of the two successive approximations up to 13ⁿ for 13-adic integer sqrt(-3). Here the 6 (mod 13) case (except for n = 0). A322089

G.f.: ∑_n>=0 (n+1)*(n+2)/2·xⁿ * (1 + xⁿ)ⁿ. A326003

Irregular triangle read by rows: T(n,k) (n >= 1, 0 <= k <= (n-1)*(n-2)/2) = number of weakly connected subdigraphs of the transitive tournament on n nodes that have k arcs. A350610

Product of n and the sum of remainders of n mod k, for k = 1, 2, 3, ..., n. A256532

Deficient numbers n having a companion m > n such that σ(n)/n = σ(m)/m. A212608

Unchanging value maps: number of 3Xn binary arrays indicating the locations of corresponding elements unequal to no horizontal, diagonal or antidiagonal neighbor in a random 0..2 3Xn array. A219144