Properties of the Number 7361

Seven Thousand Three Hundred Sixty-One

Basics

Value: 7360 → 7361 → 7362

Parity: odd

Prime: No

Previous Prime: 7351

Next Prime: 7369

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 17 × 433

Divisors: 1, 17, 433, 7361

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1110011000001

Octal: 16301

Duodecimal: 4315

Hexadecimal: 1cc1

Square: 54184321

Square Root: 85.7962703152066

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

Bisection of A001400. A14125

a(n) = n*(3·n² - 1)/2. A4188

a(n) = n*(13·n - 9)/2. A226488

Values of n such that L(10) and N(10) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227448

T(n,k) = Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 n X k array. A218354

Number of ways to partition n elements into pie slices of different sizes. A32153

Sizes of successive clusters in Z⁴ lattice. A46895

T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 nXk array. A219078

Number of integer partitions of n such that the upper-left square of the Young diagram has strictly greater graph-distance from the lower-right boundary than any other square. A325187

Diagonal sums of correlation triangle for floor((n+2)/2). A115264