Properties of the Number 67092

Sixty-Seven Thousand Ninety-Two

Basics

Value: 67091 → 67092 → 67093

Parity: even

Prime: No

Previous Prime: 67079

Next Prime: 67103

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5591

Divisors: 1, 2, 3, 4, 6, 12, 5591, 11182, 16773, 22364

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000011000010100

Octal: 203024

Duodecimal: 329B0

Hexadecimal: 10614

Square: 4501336464

Square Root: 259.02123465075215

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, 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

A diagonal of triangle A187005. A187007

Sum of remainders when n-th Fibonacci number is divided by all smaller Fibonacci numbers > 1. A72523

G.f. A(x) satisfies: [xⁿ] A(x)⁽ⁿ⁺¹²) = 0 for n>1 with a(0)=a(1)=1. A171791

a(n) = floor(X/Y) where X = concatenation in decreasing order of (2n)-th even number to (n+1)-th even number and Y = that of first n even numbers in increasing order. A67092

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