Properties of the Number 42540

Forty-Two Thousand Five Hundred Forty

Basics

Value: 42539 → 42540 → 42541

Parity: even

Prime: No

Previous Prime: 42533

Next Prime: 42557

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5 × 709

Divisors: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011000101100

Octal: 123054

Duodecimal: 20750

Hexadecimal: a62c

Square: 1809651600

Square Root: 206.25227271475094

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) = ∑_{1 <= i, j, k <= n} gcd(i,j,k). A344522

Sum of largest parts of all partitions of n into an even number of parts. A222048

G.f.: 2·q * ∏_n>=1 (1 + q^2·n)/((1 + qⁿ)*(1 + q^2·n-1)*(1 + q^4·n)) in powers of q. A293132

Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k UDDU's. A135306

Number of Dyck paths of semilength n that do not contain the string UDDU. A135307

The least k such that A063994(k) = ∏_{primes p dividing k} gcd(p-1, k-1) = n, or 0 if there's no such k. A64234

Composite k such that the primorial inflation of k is a sum of distinct primorial numbers. A351959

Number of permutations of 2 copies of 1..n avoiding adjacent step pattern up, up. A177555

Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive). A74814

Numerators of continued fraction convergents to sqrt(799). A42540