Properties of the Number 83117

Eighty-Three Thousand One Hundred Seventeen

Basics

Value: 83116 → 83117 → 83118

Parity: odd

Prime: Yes

Previous Prime: 83101

Next Prime: 83137

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 83117

Divisors: 1, 83117

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100010010101101

Octal: 242255

Duodecimal: 40125

Hexadecimal: 144ad

Square: 6908435689

Square Root: 288.3001907734367

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

Least prime p introducing prime-difference pattern {d, 2·d}, where d = 2·n, i.e., {p, p+2·n, p+2·n+4·n} = {p, p+2·n, p+6·n} are consecutive primes. A79011

Let N(p,i) denote the result of applying "nextprime" i times to p; a(n) = smallest prime p such that N(p,3) - p = 2·n, or -1 if no such prime exists. A339943

Fourth term of weak prime sextet: p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1). A54831

a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) is a multiple of 2n. A54682

a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n. A70018

Primes of the form ∑_k=1..n φ(prime(k)). A101302

Primes p such that both prevprime(p²) - 2 and nextprime(p²) + 2 are also primes. A226986

n-th prime that begins with prime(n). A229206

Numbers k such that 70^k - 69^k is prime. A62636

Smallest k such that k·n contains a single digit with multiplicity, or 0 if no such number exists. A83117