Properties of the Number 68098

Sixty-Eight Thousand Ninety-Eight

Basics

Value: 68097 → 68098 → 68099

Parity: even

Prime: No

Previous Prime: 68087

Next Prime: 68099

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 × 79 × 431

Divisors: 1, 2, 79, 158, 431, 862, 34049, 68098

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000101000000010

Octal: 205002

Duodecimal: 334AA

Hexadecimal: 10a02

Square: 4637337604

Square Root: 260.955934977536

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, that transforms diagonals in the table of coefficients in the successive iterations of x+x² (cf. A122888). A135080

Position of first 0 in the n-th differences of the noncomposite numbers (A008578), or 0 if it does not appear. A376855

Column 0 of triangle A135080. A135081

Triangle, read by rows, where row n equals the coefficients of y^k in R_n-1(y+y²) for k=1..n where R_n(y) is the n-th row polynomial in y for n>1 with R₁(y)=y. A187005

Cyclops numbers with circular digits {0,6,8,9}. A274765

Numbers k such that sopfr(k) = τ(k)³. A305349

p(11p-7) where p is prime. A98998

G.f. A(x) satisfies: [xⁿ⁺¹] A(Fⁿ(x)) = 0 for n>0 where Fⁿ(x) denotes the n-th iteration of F(x) = x+x² with F⁰(x)=x. A187009

a(n) = Lucas(Fibonacci(n)). A68098