Properties of the Number 68142

Sixty-Eight Thousand One Hundred Forty-Two

Basics

Value: 68141 → 68142 → 68143

Parity: even

Prime: No

Previous Prime: 68141

Next Prime: 68147

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 41 × 277

Divisors: 1, 2, 3, 6, 41, 82, 123, 246, 277, 554

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000101000101110

Octal: 205056

Duodecimal: 33526

Hexadecimal: 10a2e

Square: 4643332164

Square Root: 261.0402267850685

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(1) = 50 and for any n > 0, a(n+1)² is the smallest square that begins with a(n). A309123

Number of aperiodic binary strings of length n; also number of binary sequences with primitive period n. A27375

Number of primitive subsequences of {1, 2, ..., n}. A51026

a(0) = 21; for n > 0, a(n) is the smallest triangular number which is a (proper) multiple of a(n-1). A68142

G.f. satisfies: A(A(x)) = ∑_n>=1 a(n)*xⁿ / ∏_k=1..n (1 - k·x), where g.f. A(x) = ∑_n>=1 a(n)*xⁿ. A193208

Number of nX6 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 0 1 1 vertically. A208418

Number of partial binary words of length n without a critical factorization. A182075