ℕ atory
Play Now

Properties of the Number 7366

Seven Thousand Three Hundred Sixty-Six

Basics

Value: 7365 → 7366 → 7367

Parity: even

Prime: No

Previous Prime: 7351

Next Prime: 7369

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 29 × 127

Divisors: 1, 2, 29, 58, 127, 254, 3683, 7366

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110011000110

Octal: 16306

Duodecimal: 431A

Hexadecimal: 1cc6

Square: 54257956

Square Root: 85.82540416450132

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

Bernoulli number Bn has denominator 354. A255684
a(0) = 0; for n>0, a(n) = maximal number of regions into which space can be divided by n spheres. A46127
Number of starting positions of Nim with 2n pieces such that 2nd player wins. Partitions of 2n such that xor-sum of partitions is 0. A48833
Consecutive states of the linear congruential pseudo-random number generator (211·s + 1663) mod 7875 when started at s=1. A385002
Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A294541
Number of compositions of n with strictly increasing run-lengths. A333192
Number T(n,k) of partitions of [n] having k blocks containing their own index when blocks are ordered with decreasing largest elements; triangle T(n,k), n>=0, 0<=k<=ceiling(n/2), read by rows. A350647
Rounded volume of a regular octahedron with edge length n. A71400
Twice 11-gonal numbers: a(n) = n*(9·n-7). A152995
Number T(n,k) of partitions of [n] such that the sum of elements i contained in block i equals k when blocks are ordered with decreasing largest elements; triangle T(n,k), n>=0, 0<=k<=max(0,A008805(n-1)), read by rows. A350684