Properties of the Number 81112

Eighty-One Thousand One Hundred Twelve

Basics

Value: 81111 → 81112 → 81113

Parity: even

Prime: No

Previous Prime: 81101

Next Prime: 81119

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 10139

Divisors: 1, 2, 4, 8, 10139, 20278, 40556, 81112

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011110011011000

Octal: 236330

Duodecimal: 3AB34

Hexadecimal: 13cd8

Square: 6579156544

Square Root: 284.80168538827155

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

Multiples of 2 in which there is no common digit in successive terms. A83490

Multiples of 4 in which there is no common digit in successive terms. A83492

Multiples of 8 in which there is no common digit in successive terms. A83496

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2. A214038

a(1) = 0; for n > 1: a(n) = smallest even number greater than a(n-1) which does not use any digit used by a(n-1). A229363

Number of nX2 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to one or two horizontal or vertical neighbors. A199035

Growth series for group with presentation < S, T : S² = T³ = (S·T)⁹ = 1 >. A298811

T(n,k)=Number of nXk 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to one or two horizontal or vertical neighbors. A199041

Let s(x)=floor(π*x); sequence gives the least k such that n divides s^k(n) where s^k(x) denotes s(s(s..s(x))..) k times, or 0 if no such k exists. A81112