Properties of the Number 52490

Fifty-Two Thousand Four Hundred Ninety

Basics

Value: 52489 → 52490 → 52491

Parity: even

Prime: No

Previous Prime: 52489

Next Prime: 52501

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 29 × 181

Divisors: 1, 2, 5, 10, 29, 58, 145, 181, 290, 362

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100110100001010

Octal: 146412

Duodecimal: 26462

Hexadecimal: cd0a

Square: 2755200100

Square Root: 229.10696191953662

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 Goldbach partitions (p,q) and (r,s) such that k | (p·q -1) and k | (r·s +1). A336584

a(n) is the smallest number that is the sum of n positive 6th powers in two ways. A343079

Numbers n such that (π/e)ⁿ is closer to its nearest integer than any value of (π/e)^k for 1 <= k < n. A80284

Triangle of order m: C(n,k) = k*(n-k+1)^k+m+n-k, 0 <= k <= n, m = 0, read by rows. A278910

Expansion of exp( ∑_n>=1 -sigma₂(2·n)*xⁿ/n ) in powers of x. A283242

a[n] =a[n-1] + 2·n*Prime[n]-n². A93809

Numbers k such that there is exactly one number which is k times the sum of its digits. A52490

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0ⁿ and T(n,k) = k * ∑_r=0..n binomial(n+2·r+k,r) * binomial(r,n-r)/(n+2·r+k) for k > 0. A378290