Properties of the Number 68052

Sixty-Eight Thousand Fifty-Two

Basics

Value: 68051 → 68052 → 68053

Parity: even

Prime: No

Previous Prime: 68041

Next Prime: 68053

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 53 × 107

Divisors: 1, 2, 3, 4, 6, 12, 53, 106, 107, 159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000100111010100

Octal: 204724

Duodecimal: 33470

Hexadecimal: 109d4

Square: 4631074704

Square Root: 260.867782602605

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

T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once. A269201

Number of partitions of n with rank a multiple of 3. A328988

Triangle read by rows: Take a hexagon with all diagonals drawn, as in A331931. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+4. A331932

Number of n X 5 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once. A269198

Number of 2 X n 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once. A269202

Start from 1, shift one left and sum mod 2 (bitwise-XOR) to get 3 (11 in binary), then shift two steps left and XOR to get 15 (1111 in binary), then three steps and XOR to get 119 (1110111 in binary), then four steps and so on. A68052