Properties of the Number 83391

Eighty-Three Thousand Three Hundred Ninety-One

Basics

Value: 83390 → 83391 → 83392

Parity: odd

Prime: No

Previous Prime: 83389

Next Prime: 83399

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 11 × 19 ²

Divisors: 1, 3, 7, 11, 19, 21, 33, 57, 77, 133

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100010110111111

Octal: 242677

Duodecimal: 40313

Hexadecimal: 145bf

Square: 6954058881

Square Root: 288.7749989178426

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

a(n) = (2·n+1)*(4·n²+4·n+3)/3. A57813

Number of partitions of 6n into exactly 4 parts. A256328

Solution of the complementary equation a(n) = 2·a(n-2) - b(n-2) + n, where a(0) = 3, a(1) = 4, b(0) = 1, and (a(n)) and (b(n)) are increasing complementary sequences. A295069

a(n) = a(n-1) + a(n-2) - n·a(floor(n/2)), where a(0) = 1, a(1) = 1, a(2) = 1. A298400

Smallest number such that n-th iterate of Chowla function is 0. A2954

Numbers k with property that 19·k + {2,4,8,10} are two pairs of consecutive twin primes. A152926

Number of arrays of the median of three adjacent elements of some length-(n+2) 0..4 array. A228736

T(n,k) = number of arrays of the median of three adjacent elements of some length n+2 0..k array. A228740

n-th Payam number E_-(n), defined as the smallest positive odd integer k such that for every positive integer m, the number k·2^m-1 is not divisible by any primes p such that the multiplicative order of 2 mod p is less than or equal to n. A83391