ℕ atory
Play Now

Properties of the Number 25123

Twenty-Five Thousand One Hundred Twenty-Three

Basics

Value: 25122 → 25123 → 25124

Parity: odd

Prime: No

Previous Prime: 25121

Next Prime: 25127

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 7 × 37 × 97

Divisors: 1, 7, 37, 97, 259, 679, 3589, 25123

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001000100011

Octal: 61043

Duodecimal: 12657

Hexadecimal: 6223

Square: 631165129

Square Root: 158.5023659129415

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 zero-sum nXk -2..2 arrays with every element equal to at least one horizontal or vertical neighbor. A201888
Number of dispersed Dyck paths of length n (i.e., of Motzkin paths of length n with no (1,0)-steps at positive heights) having no base pyramids. A base pyramid is a factor of the form Uj Dj (j>0), starting at the horizontal axis. Here U=(1,1) and D=(1,-1). A191393
Setwise difference A340150 \ A340076. A340151
a(n) is the index of the smallest n-gonal number with exactly n prime factors (counted with multiplicity). A359014
Number of zero-sum nX2 -2..2 arrays with every element equal to at least one horizontal or vertical neighbor. A201885
Triangle read by rows: T(n,k) is the coefficient Ak in the transformation ∑k=0..n (k+1)*xk = ∑k=0..n Ak*(x-3)k. A246799
Numbers k such that the sum of the divisors of k is of the form m3 + 1. A289384
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 0, -1), (0, 1, 1), (1, -1, -1)}. A148596
a(n) = A159065(n+1) - A334701(n). A335677
a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A001950 (upper Wythoff sequence), t = A023533. A25123