Properties of the Number 51240

Fifty-One Thousand Two Hundred Forty

Basics

Value: 51239 → 51240 → 51241

Parity: even

Prime: No

Previous Prime: 51239

Next Prime: 51241

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 7 × 61

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100100000101000

Octal: 144050

Duodecimal: 257A0

Hexadecimal: c828

Square: 2625537600

Square Root: 226.36254107073458

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

Partial sums of A299291. A299292

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every element next to itself plus and minus one within the range 0..3 horizontally, vertically or antidiagonally, with no adjacent elements equal. A232391

Coefficient of x² in the polynomial (x-p(n))*(x-p(n+1))*(x-p(n+2))*(x-p(n+3)), where p(k) is the k-th prime. A127348

Least k > 1 such that kⁿ is a twin rank (cf. A002822: 6·kⁿ +- 1 are twin primes). A326230

Primorial deflation of the n-th colossally abundant number: the unique integer k such that A108951(k) = A004490(n). A342012

Numbers n such that {largest m such that 1, 2, ..., m divide n} is different from {largest m such that m! divides n²}. A232099

Number of permutations of n copies of 1..4 with all adjacent differences <= 2 in absolute value. A177322

Sequence lists numbers k > 1 such that k⁴ == φ(k) (mod σ(k)), where φ = A000010 and σ = A000203. A324216

Glaisher's function H'(4n+1) (18 squares version). A2610

Triangle T, read by rows : T(n,k) = A007318(n,k)*A026641(n-k). A171650