Properties of the Number 25136

Twenty-Five Thousand One Hundred Thirty-Six

Basics

Value: 25135 → 25136 → 25137

Parity: even

Prime: No

Previous Prime: 25127

Next Prime: 25147

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁴ × 1571

Divisors: 1, 2, 4, 8, 16, 1571, 3142, 6284, 12568, 25136

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001000110000

Octal: 61060

Duodecimal: 12668

Hexadecimal: 6230

Square: 631818496

Square Root: 158.54336946085132

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

a(1)=1. a(n) = a(n-1) + sum of the triangular numbers which are among the first (n-1) terms of the sequence. A100963

a(n) is the number of fixed polyominoes with sprawl n. A338212

Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 9. A240018

a(n) = total number of binary sequences S of length n and curling number k (so S = XY^k) in which Y can be taken to have length 1. A217932

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

Positions where number of periodic partitions increases. A59994

G.f. A(x) satisfies: ∏_n=-oo..+oo [1 + (-A(x))ⁿ * (1 - (-A(x))ⁿ)ⁿ] = 2·x. A295131

a(n) = 2nd elementary symmetric function of C(n,0), C(n,1), ..., C(n,[ n/2 ]). A25136