Properties of the Number 45241

Forty-Five Thousand Two Hundred Forty-One

Basics

Value: 45240 → 45241 → 45242

Parity: odd

Prime: No

Previous Prime: 45233

Next Prime: 45247

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 23 × 281

Divisors: 1, 7, 23, 161, 281, 1967, 6463, 45241

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1011000010111001

Octal: 130271

Duodecimal: 22221

Hexadecimal: b0b9

Square: 2046748081

Square Root: 212.69931828757703

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 with the property that k is a substring of its base-6 representation. A38106

T(n,k)=number of sequences of n integers p(i) i=0..n-1 0<=p(i)<=k·i and |p(i+1)-p(i)|<=k. A180906

Triangle of coefficients of Gaussian polynomials [2n+5,4]_q represented as finite sum of terms (1+q²)^k*q^g-k, where k = 0,1,...,g with g=4n+2. A267484

a(n) = RMS( A141393(0) through A141393(n) ). A141394

a(n) gives the odd leg of one of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)². This is the smaller of the two possible odd legs. A253802

a(0)=0, a(1)=1, a(n) = a(n-1)*12 + 13. A240846

Number of sequences of n integers p(i) i=0..n-1 with 0<=p(i)<=5·i and |p(i)-p(i-1)|<=5. A180901

Number of zero-sum -n..n arrays of 5 elements with adjacent element differences also in -n..n. A202255

Numbers whose base-5 representation contains exactly two 1's and one 3. A45241