Properties of the Number 45925

Forty-Five Thousand Nine Hundred Twenty-Five

Basics

Value: 45924 → 45925 → 45926

Parity: odd

Prime: No

Previous Prime: 45893

Next Prime: 45943

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 ² × 11 × 167

Divisors: 1, 5, 11, 25, 55, 167, 275, 835, 1837, 4175

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1011001101100101

Octal: 131545

Duodecimal: 226B1

Hexadecimal: b365

Square: 2109105625

Square Root: 214.3011899173684

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

Numbers k such that σ(k) = σ(k+8). A15876

a(0) = 0, a(1) = 1, and a(n) = ((2·n - 1)*a(n-1) + 3·n*a(n-2))/(n - 1) for n >= 2. A102839

Sum of squares of first n positive integers congruent to 1 mod 3. A24215

a(n) is the smallest number, larger than the previous, such that the RMS (Root Mean Square) of a(0) through a(n) is an integer. A141393

a(n) = ∑_i=0..n i·Fibonacci(i)². A282464

Product of Fibonacci and Motzkin numbers: a(n) = A000045(n+1)*A001006(n). A200539

a(n) = ∑_{k=0..floor(n/3)} binomial(n+k-1,k) * binomial(n+2·k-1,n-3·k). A389378

Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H steps (0<=k<=floor(n/2)). A132280

a(n) = 7·3ⁿ - 2. A355492

a(n) = n·Fibonacci(n). A45925