Properties of the Number 93308

Ninety-Three Thousand Three Hundred Eight

Basics

Value: 93307 → 93308 → 93309

Parity: even

Prime: No

Previous Prime: 93307

Next Prime: 93319

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 23327

Divisors: 1, 2, 4, 23327, 46654, 93308

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110110001111100

Octal: 266174

Duodecimal: 45BB8

Hexadecimal: 16c7c

Square: 8706382864

Square Root: 305.4635821174105

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

T(n,k)=Number of 0..3 arrays of length n+2·k-1 with sum no more than 3·k in any length 2k subsequence (=50% duty cycle). A212471

T(n,k)=Number of length n+5 0..k arrays with no consecutive six elements summing to more than 3·k. A242144

Number of 0..3 arrays of length n+5 with sum no more than 9 in any length 6 subsequence (=50% duty cycle). A212466

Number of 0..3 arrays of length 2·n+3 with sum no more than 3·n in any length 2n subsequence (=50% duty cycle). A212475

Number of length 4+5 0..n arrays with no consecutive six elements summing to more than 3·n. A242148

a(n) is the least positive number k such that n is the greatest m such that k is a quadratic nonresidue mod prime(i+1) for i=1..m and {k mod prime(i+1): i=1..m} are all distinct. A385051

a(n) = Fibonacci(prime(prime(n))). A93308