Properties of the Number 25207

Twenty-Five Thousand Two Hundred Seven

Basics

Value: 25206 → 25207 → 25208

Parity: odd

Prime: No

Previous Prime: 25189

Next Prime: 25219

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 13 × 277

Divisors: 1, 7, 13, 91, 277, 1939, 3601, 25207

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001001110111

Octal: 61167

Duodecimal: 12707

Hexadecimal: 6277

Square: 635392849

Square Root: 158.7671250605742

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 4 X n binary matrices up to row and column permutations. A6148

Number of maximal subsets of {1..n} such that it is possible to choose a different binary index of each element. A370640

Triangle of coefficients, read by row polynomials P_n(y), that satisfy the g.f.: A096651(x,y) = ∏_n>=1 1/(1-xⁿ)^[P_n(y)/n], with P_n(0)=0 for n>=1. A96800

a(n) = ∑_k=0..n (k+1) * A026659(n,k). A26980

Numbers k such that the leading k digits of k^k in decimal form a prime or a probable prime. A211404

Triangle read by rows: T(n,k) = number of n-node graphs with k nodes in distinguished bipartite block, k = 0..n. A28657

Number of one-sided triangulations of the disk; or flexagons of order n; or unlabeled plane trivalent trees (n-2 internal vertices, all of degree 3 and hence n leaves). A1683

Number of inequivalent m X n binary matrices, where equivalence means permutations of rows or columns. Presented in diagonal order, with (m,n) = (1,1), (1,2), (2,1), (1,3), (2,2), (3,1), ... . A241956

a(n) = [ Sum{(log(j)-log(i))³} ], 2 <= i < j <= n. A25207