Properties of the Number 25131

Twenty-Five Thousand One Hundred Thirty-One

Basics

Value: 25130 → 25131 → 25132

Parity: odd

Prime: No

Previous Prime: 25127

Next Prime: 25147

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 8377

Divisors: 1, 3, 8377, 25131

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001000101011

Octal: 61053

Duodecimal: 12663

Hexadecimal: 622b

Square: 631567161

Square Root: 158.52760012060992

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(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3), t = A023532. A24314

T(n,k) = Number of n X k 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302953

Number of (w,x,y,z) with all terms in {1,...,n} and w²<x²+y²+z². A212092

Numbers such that the sum of the factorials of the digits of the fourth power is a square. A126077

Number of nX3 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302948

Number of 6Xn 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302957

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 3), t = (Lucas numbers). A24877

Odd numbers in sorted order from generation 2 onwards. A48462

3rd elementary symmetric function of C(n,0), C(n,1), ..., C(n,n). A25131