Properties of the Number 9361

Nine Thousand Three Hundred Sixty-One

Basics

Value: 9360 → 9361 → 9362

Parity: odd

Prime: No

Previous Prime: 9349

Next Prime: 9371

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 11 × 23 × 37

Divisors: 1, 11, 23, 37, 253, 407, 851, 9361

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010010010001

Octal: 22221

Duodecimal: 5501

Hexadecimal: 2491

Square: 87628321

Square Root: 96.75226095549395

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

Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6·k*(k-1) + 1. A3154

Numbers k such that there is more than one perfect power·in the range prime(k) < x < prime(k+1). A377466

a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3). A24312

Number of partitions of n with odd minimal and maximal parts. A325338

a(n) = n*(n+1)*(5·n+1)/6. A33994

Squarefree integers m > 1 such that if prime p divides m, then the sum of the base p digits of m is at least p. A324315

16-gonal (or hexadecagonal) numbers: a(n) = n*(7·n-6). A51868

Smallest number which requires n iterations to reach 1 in the juggler sequence problem. A94670

a(0) = 0, a(1) = 1; a(2·n) = a(n), a(2·n+1) = 8·a(n) + a(n+1). A342637

T(n,k)=Number of arrays of -k..k integers x(1..n) with every x(i) being in a substring of length 1 or 2 with sum zero. Array listed by antidiagonals. A193648