Properties of the Number 12536

Twelve Thousand Five Hundred Thirty-Six

Basics

Value: 12535 → 12536 → 12537

Parity: even

Prime: No

Previous Prime: 12527

Next Prime: 12539

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 1567

Divisors: 1, 2, 4, 8, 1567, 3134, 6268, 12536

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000011111000

Octal: 30370

Duodecimal: 7308

Hexadecimal: 30f8

Square: 157151296

Square Root: 111.96428001822724

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 integer partitions of n with reverse-alternating sum < 0. A344608

Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. A11117

Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ...} and never pass below y = x. Sequence gives S(n-1,n) = number of 'Schröder' trees with n+1 leaves and root of degree 2. A10683

Number of integer partitions of 2n with reverse-alternating sum < 0. A344743

Triangle read by rows: T(n,k) is number of Schroeder paths of length 2n and having k peaks at height 1, for 0 <= k <= n. A104219

Number of integer partitions of n such that the maximum is greater than twice the median. A361857

a(n) is the number of nonnegative integers that can be represented in a 7-segment display by using only n segments (version A010371). A331530

Smallest even fundamental discriminant k such that h(-k) = 2n, where h(D) is the class number of the quadratic field with discriminant D; or 0 if no such k exists. A344072

Regular triangle, T(n, k) = f(n, k) - f(n, 0) + 1, where f(n, k) = ∑_j=0..k (-1)^j*StirlingS2(n, n-j)*binomial(n,j) + ∑_j=0..n-k (-1)^j*StirlingS2(n, n-j)*binomial(n, j), read by rows. A176156

Number of uniquely solveable n X m nonograms (hanjie), read by antidiagonals. A384764