Properties of the Number 52126

Fifty-Two Thousand One Hundred Twenty-Six

Basics

Value: 52125 → 52126 → 52127

Parity: even

Prime: No

Previous Prime: 52121

Next Prime: 52127

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 67 × 389

Divisors: 1, 2, 67, 134, 389, 778, 26063, 52126

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100101110011110

Octal: 145636

Duodecimal: 261BA

Hexadecimal: cb9e

Square: 2717119876

Square Root: 228.3111911405133

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) = (2·5ⁿ + 2ⁿ)/3. A82685

T(n,k) = Number of n X k nonnegative integer arrays with each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it). A202549

T(n,k)=Number of nXk 0..2 arrays with new values introduced in each row and column in sequential order starting with zero. A268056

T(n,k)=Number of nXk nonnegative integer arrays with new values introduced in each row and column in sequential order starting with zero. A268079

Expansion of ∏_k>=1 ((1 + x^5·k) / (1 - x^k))^k. A285461

Integers n such that the century defined by the interval [100n+1, 100n+100] (i.e., the (n+1)-st century) contains exactly one Ormiston prime pair and no other primes. A162895

a(1) = 1; for n>1, a(n)=n/(largest prime dividing n). A52126

Number of (n+1)X4 0..2 arrays containing all values 0..2 with every 2X2 subblock having two or three distinct values, and new values 0..2 introduced in row major order. A210007