Properties of the Number 13557

Thirteen Thousand Five Hundred Fifty-Seven

Basics

Value: 13556 → 13557 → 13558

Parity: odd

Prime: No

Previous Prime: 13553

Next Prime: 13567

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 4519

Divisors: 1, 3, 4519, 13557

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11010011110101

Octal: 32365

Duodecimal: 7A19

Hexadecimal: 34f5

Square: 183792249

Square Root: 116.43453096053592

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

Number of ways to split an integer partition of n into consecutive subsequences. A323583

G.f. satisfies A(x) = 1 + x·cycle_index(Alt(4), A(x)). A36717

Number of uniform rooted trees with n nodes. A317712

Number of partitions of n-th triangular number (A000217) into distinct triangular parts. A288126

a(n) = arrange digits of concatenation of divisors of n (A037278, A176558) in increasing order in base 10 (zero digits are omitted). A243361

Numbers n such that A307042(n) = ∑_k=1..n esigma(k) is divisible by n, where esigma(k) is sum of exponential divisors of k (A051377). A307043

a(n) is the smallest number such that the product of its digits is n times the sum of its digits, or 0 if no such number exists. A126789

A126789 with zeros removed. A176623

Number of length 3 1..(n+2) arrays with no leading partial sum equal to a prime. A254541

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