Properties of the Number -15475

Fifteen Thousand Four Hundred Seventy-Five

Basics

Value: -15476 → -15475 → -15474

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 ² × 619

Divisors: 1, 5, 25, 619, 3095, 15475

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11110001110011

Octal: -36163

Duodecimal: -8B57

Hexadecimal: -3c73

Square: 239475625

Square Root: 124.39855304624729

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: Coefficients of the polynomials S1(n, x) * EZ(n, x), where S1 denote the Stirling1 polynomials and EZ the Eulerian zig-zag polynomials A205497. A373429

A three-dimensional version of the cellular automaton A160118, using cubes. A160119

Number of partitions of n with even crank. A124227

a(n) = ∑_d∣n d*σ(n/d)^d. A185302

Partial sums of 3-almost primes which are again 3-almost primes, i.e., have exactly 3 not necessarily distinct prime factors. A217018

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 141", based on the 5-celled von Neumann neighborhood. A270284

Number of nX3 0..1 arrays with every element unequal to 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero. A304144

a(n) = ∑_{k=1..n, gcd(n,k) = 1} Stirling2(n,k). A308463

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (F(2), F(3), F(4), ...). A25082

For each prime p take the sum of nonprimes < p. A45717