ℕ atory
Play Now

Properties of the Number 68086

Sixty-Eight Thousand Eighty-Six

Basics

Value: 68085 → 68086 → 68087

Parity: even

Prime: No

Previous Prime: 68071

Next Prime: 68087

Digit Sum: 28

Digital Root: 1

Palindrome: Yes

Factorization: 2 × 59 × 577

Divisors: 1, 2, 59, 118, 577, 1154, 34043, 68086

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000100111110110

Octal: 204766

Duodecimal: 3349A

Hexadecimal: 109f6

Square: 4635703396

Square Root: 260.93294157695

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

Smallest multiple k·n of n which has even digits and is a palindrome or becomes a palindrome when 0's are added on the left (e.g., 10 becomes 010, which is a palindrome). A62293
T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234665
Obtain m by omitting trailing zeros from n; a(n) = smallest multiple k·m which is a palindrome with even digits, or -1 if no such multiple exists. A61915
Palindromes whose smallest palindromic proper multiple is the number concatenated with itself. A119368
Cyclops numbers with circular digits {0,6,8,9}. A274765
Number of step shifted (decimated) sequence structures of length n using an infinite alphabet. A288621
The smallest palindrome with exactly n circular loops (or holes) in its decimal representation. A337842
Number of distinct solutions of sum{i=1..3}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2. A180826
Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234659
Number of (n+1) X (4+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234662