Properties of the Number 42653

Forty-Two Thousand Six Hundred Fifty-Three

Basics

Value: 42652 → 42653 → 42654

Parity: odd

Prime: No

Previous Prime: 42649

Next Prime: 42667

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 13 × 17 × 193

Divisors: 1, 13, 17, 193, 221, 2509, 3281, 42653

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011010011101

Octal: 123235

Duodecimal: 20825

Hexadecimal: a69d

Square: 1819278409

Square Root: 206.52602741543257

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

Number of partitions of n that sorted in increasing order contain a part k in position k for some k. A238395

T(n,k)=Number of length n+k 0..3 arrays with at most two downsteps in every k consecutive neighbor pairs. A255660

For n>0, a(n) is the least quasi-Carmichael number to base -n, extended to n=0 with the least composite squarefree integer. A29591

Gaps of 6 in sequence A038593 (lower terms). A38651

Least k such that φ(k) has exactly n divisors. A276044

Let b(1)=1, b(2)=2, b(n) = sum of digits of b(1)+b(2)+b(3)+...+b(n-1), sequence gives values of n such that b(n)=3. A84229

a(n) = (3-4·n)*F(2·n-2) + (4-7·n)*F(2·n-1). A165206

Number of length n+5 0..3 arrays with at most two downsteps in every 5 consecutive neighbor pairs. A255657

Number of length n+3 0..3 arrays with at most two downsteps in every n consecutive neighbor pairs. A255663

Odd squarefree numbers n > 1 such that λ(n)² = φ(n), where λ is the Carmichael λ function and φ is Euler's totient function. A276980