Properties of the Number 93371

Ninety-Three Thousand Three Hundred Seventy-One

Basics

Value: 93370 → 93371 → 93372

Parity: odd

Prime: Yes

Previous Prime: 93337

Next Prime: 93377

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 93371

Divisors: 1, 93371

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110110010111011

Octal: 266273

Duodecimal: 4604B

Hexadecimal: 16cbb

Square: 8718143641

Square Root: 305.5666866659388

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

Primes that remain prime through 4 iterations of function f(x) = 9x + 2. A23324

a(n) = ∑_k=1..n (n/gcd(k,n))^n/gcd(k,n). A342420

Primes p such that p-1 is a partial sum of A014574. A343711

Primes that remain prime through 5 iterations of function f(x) = 9x + 2. A23352

Primes of the form a^a + b^b + c^c + d^d + e^e + f^f. A136294

Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^n-1 starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words·and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k = 1. A93371

Numbers k such that (28·10^k + 113)/3 is prime. A271147