Properties of the Number 68166

Sixty-Eight Thousand One Hundred Sixty-Six

Basics

Value: 68165 → 68166 → 68167

Parity: even

Prime: No

Previous Prime: 68161

Next Prime: 68171

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 7 × 541

Divisors: 1, 2, 3, 6, 7, 9, 14, 18, 21, 42

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000101001000110

Octal: 205106

Duodecimal: 33546

Hexadecimal: 10a46

Square: 4646603556

Square Root: 261.08619266441497

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

Triangle read by rows, T(n, k) = binomial(n, k) * ∑_j=0..n-k E(n-k, j)*2^j, where E(n, k) are the Eulerian numbers A173018(n, k), for 0 <= k <= n. A154921

Triangle relating to ordered Bell numbers, A000670. A208744

Shifts left under XOR-convolution: a(n) = ∑_k=0..n-1 a(k) XOR a(n-k-1) for n>1 with a(0)=1, a(1)=2. A192484

Sum of largest parts of all partitions of n plus n. Also, total number of parts in all partitions of n plus n. A225596

Number of (n+1) X 3 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A204645

Triangle read by rows: T(n,k) is the number of labeled loop-threshold graphs on vertex set [n] with k components, for n >= 1 and 1 <= k <= n. A350531

Number of reduced magic borders of order n (these extend magic squares of order n-2 to order n). A91990

Define an increasing sequence as follows. Given the first term, called the seed (which need not share the property of the remaining terms), subsequent terms are obtained by inserting at least one digit in the previous term so as to obtain the smallest number with the specified property. This is the prime sequence with the seed a(1) = 1. A68166