Properties of the Number 42762

Forty-Two Thousand Seven Hundred Sixty-Two

Basics

Value: 42761 → 42762 → 42763

Parity: even

Prime: No

Previous Prime: 42751

Next Prime: 42767

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7127

Divisors: 1, 2, 3, 6, 7127, 14254, 21381, 42762

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011100001010

Octal: 123412

Duodecimal: 208B6

Hexadecimal: a70a

Square: 1828588644

Square Root: 206.78974829521894

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) = ∑_k=0..n T(k) where T(n) are the tribonacci numbers A000073. A8937

List of different composites in Pascal-like triangles with index of asymmetry y = 2 and index of obliquity z = 0 or z = 1. A141066

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

Let M(n) = maximal value of (n/k)^k over all k = 1, 2, ...; a(n) = floor(M(n)). A139076

Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(4,8). A18921

Number of quadrilateral regions in an equilateral triangular "frame" of size n (see Comments in A328526 for definition). A333033

Expansion of ∑_k>0 x^2·k/(1+x^k)⁶. A363614

Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0011 (n,k>=0). A118884

Expansion of (1-x)^-1/(1 + x - x² + x³). A77902

Numbers n such that 2·10ⁿ - 7 is prime. A102946