Properties of the Number 42676

Forty-Two Thousand Six Hundred Seventy-Six

Basics

Value: 42675 → 42676 → 42677

Parity: even

Prime: No

Previous Prime: 42667

Next Prime: 42677

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 47 × 227

Divisors: 1, 2, 4, 47, 94, 188, 227, 454, 908, 10669

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011010110100

Octal: 123264

Duodecimal: 20844

Hexadecimal: a6b4

Square: 1821240976

Square Root: 206.58170296519486

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

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+17)² = y². A118120

Bisection (odd part) of Chebyshev sequence with Diophantine property. A77235

Combined Diophantine Chebyshev sequences A077236 and A077235. A77238

a(n) = 7·a(n-1) - 7·a(n-2) + a(n-3) for n > 2; a(0) = 28, a(1) = 207, a(2) = 1248. A155466

Site percolation series for square lattice: coefficients of the power series expansion in powers of q=1-p of the probability that a given site (not assumed to be open) belongs to the infinite cluster, where p is the probability that a site is open. A391388

Number of non-isomorphic directed graphs reachable in n steps (and no fewer) by at least 2·n agents using the ANY protocol (see A318154). A383389

Total number of runs of 1's in all length n binary words in which 1's occur in runs of at least 3. A387573

a(n) = ∑_k=0..n (k+1) * binomial(2·k+1,2·n-2·k+1). A391890

The values of 'a' in a² + b² = c², where b - a = 17 and gcd(a, b, c) = 1. A117473

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 139", based on the 5-celled von Neumann neighborhood. A270280