ℕ atory
Play Now

Properties of the Number 25114

Twenty-Five Thousand One Hundred Fourteen

Basics

Value: 25113 → 25114 → 25115

Parity: even

Prime: No

Previous Prime: 25111

Next Prime: 25117

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 29 × 433

Divisors: 1, 2, 29, 58, 433, 866, 12557, 25114

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001000011010

Octal: 61032

Duodecimal: 1264A

Hexadecimal: 621a

Square: 630712996

Square Root: 158.47397262642215

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

T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 4 neighboring 1s. A297720
Number of partitions of n such that (maximal multiplicity of parts) = (multiplicity of the least part). A240303
Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 9. A31422
Number of arcs covered by other arcs in all RNA secondary structures of size n+5 (i.e., with n+5 nodes). A110318
Nodes of tree generated as follows: (1,2) is an edge, and if (x,y) is an edge, then (y,x·y) and (y,x2 + y2) are edges. A228939
Number of (n+2) X (2+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010101 or 01010101. A259736
Number of 2Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 4 neighboring 1s. A297721
Number of strict triquanimous partitions of 3n. A372122
Total number of incoming edges at depth n in the solid partitions graph. A244252
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence). A25114