Properties of the Number 25907

Twenty-Five Thousand Nine Hundred Seven

Basics

Value: 25906 → 25907 → 25908

Parity: odd

Prime: No

Previous Prime: 25903

Next Prime: 25913

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 7 × 3701

Divisors: 1, 7, 3701, 25907

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010100110011

Octal: 62463

Duodecimal: 12BAB

Hexadecimal: 6533

Square: 671172649

Square Root: 160.95651586686387

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

Reversion of x - x² + x⁵. A63028

Sides of integer Heronian triangles [A068967(n), prime(A068967(n)), a(n)] with area A068969(n). A68968

Sort-then-add sequence: a(1) = 316, a(n+1) = a(n) + sort(a(n)). A33861

a(n) = 529·n² - 2·n. A158364

Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = ∑_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - ∑_i=1..n p(i). A24850

Number of nX2 0..4 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A200984

Smallest natural number requiring n applications of the map x -> 2^x mod x = A015910(x) to reach 0. A372707

Number of permutations of length n which avoid the patterns 1234, 2431, 4213. A116813

Expansion of 1/((1-x⁶)*(1-x¹¹)*(1-x¹²)). A25907