Properties of the Number -13335

Thirteen Thousand Three Hundred Thirty-Five

Basics

Value: -13336 → -13335 → -13334

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 7 × 127

Divisors: 1, 3, 5, 7, 15, 21, 35, 105, 127, 381

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11010000010111

Octal: -32027

Duodecimal: -7873

Hexadecimal: -3417

Square: 177822225

Square Root: 115.47727049077668

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

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3.3.4.3.4 2D tiling (cf. A219529). A299255

Number of double-free integer partitions of n. A323092

Numbers m such that there are precisely 7 groups of order m. A249550

Number T(n,k) of set partitions of [n] with maximal block length multiplicity equal to k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A271423

Expansion of g.f. z*(2-2·z+z²+z³)/((1+z)*(1-3·z+2·z²-z³)). A137249

Numbers n for which A325565(n) < A325568(n). A325569

a(1) = 1; for n > 1, a(n) is the least odd number k such that A325567(k) = 2·n-1, or 0 if no such number exists. A379128

n+prime(n)+prime(prime(n)) is a triangular number, where prime(n) is the n-th prime. A116010

Smallest m such that gcd(A227113(m+1), A227113(m)) = n. A227289

Number of set partitions of [n] with maximal block length multiplicity equal to four. A271733