Properties of the Number 81111

Eighty-One Thousand One Hundred Eleven

Basics

Value: 81110 → 81111 → 81112

Parity: odd

Prime: No

Previous Prime: 81101

Next Prime: 81119

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 19 × 1423

Divisors: 1, 3, 19, 57, 1423, 4269, 27037, 81111

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011110011010111

Octal: 236327

Duodecimal: 3AB33

Hexadecimal: 13cd7

Square: 6578994321

Square Root: 284.79992977527223

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

Numbers k such that A003313(k) = A003313(5·k). A116460

Multiples of 3 in which there is no common digit in successive terms. A83491

Smallest number k > 0 such that σ(x) and σ(x)+2 are both prime, where x = (6k+1)⁶ⁿ⁺⁴, or -1 if no such k exists. A275237

a(n) = ∑_k=0..n p(k) where p(k) = number of partitions of k (A000041). A70

a(n) is the smallest prime ending in exactly n 1's. A65821

Triangle read by rows where T(n,k) is the number of length-k knapsack partitions of n. A325592

Numbers k such that 8·10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k. A56722

Primes of the form 8·10^k + R_k, where R_k is the repunit (A002275) of length k. A93633

Let s(x)=floor(φ*x) where φ is the golden ratio (1+sqrt(5))/2; 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 number exists. A81111