Properties of the Number 42510

Forty-Two Thousand Five Hundred Ten

Basics

Value: 42509 → 42510 → 42511

Parity: even

Prime: No

Previous Prime: 42509

Next Prime: 42533

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 13 × 109

Divisors: 1, 2, 3, 5, 6, 10, 13, 15, 26, 30

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011000001110

Octal: 123016

Duodecimal: 20726

Hexadecimal: a60e

Square: 1807100100

Square Root: 206.17953341687434

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

G.f. A(x) satisfies A(x/A(x)³) = 1 + x ; thus A(x) = 1 + series_reversion(x/A(x)³). A120972

a(n) = number of L-convex polyominoes inscribed in an (n+1) X (n+1) box. A126765

a(n) is n-th term of the Euler transform of -n,1,1,1,... . A292541

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A120973. A381603

Number of multisets of exactly ten partitions of positive integers into distinct parts with total sum of parts equal to n. A320795

Expansion of ∑_k>0 (1/(1-x^k)⁶ - 1). A363696

a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972). A338474

Square array read by antidiagonals: T(m,n) is the number of L-convex polyominoes with m rows and n columns. A181370

a(n) = ∑_k=0..n abs(Stirling1(n,k)) * Stirling2(n,n-k). A384501

Numerators of continued fraction convergents to sqrt(783). A42510