Properties of the Number 42623

Forty-Two Thousand Six Hundred Twenty-Three

Basics

Value: 42622 → 42623 → 42624

Parity: odd

Prime: No

Previous Prime: 42611

Next Prime: 42641

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 7 × 6089

Divisors: 1, 7, 6089, 42623

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011001111111

Octal: 123177

Duodecimal: 207BB

Hexadecimal: a67f

Square: 1816720129

Square Root: 206.45338456901112

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: x = ∑_n>=1 1/A(x)^6·n * ∏_k=1..n (1 - 1/A(x)^2·k-1). A214693

Every suffix prime and no 0 digits in base 7 (written in base 7). A24782

a(n) is the smallest number representable in exactly n ways as a sum of 2 palindromes (each of them >= 0). A115336

a(n) = 74·n² - 1. A158744

Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 8 (most significant digit on right). A61961

[ exp(1/18)*n! ]. A30883

a(n) is the least positive integer that can be expressed as the sum of two distinct nonzero decimal palindromes in exactly n ways. A364836

Triangle, read by rows of n² terms, where row n equals the coefficients in the series reversion of the function G(y,n)-1 such that: y = ∑_m>=1 1/G(y,n)^2·n*m * ∏_k=1..m (1 - 1/G(y,n)^2·k-1). A214690

Denominators of continued fraction convergents to sqrt(840). A42623