Properties of the Number 1362

One Thousand Three Hundred Sixty-Two

Basics

Value: 1361 → 1362 → 1363

Parity: even

Prime: No

Previous Prime: 1361

Next Prime: 1367

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 227

Divisors: 1, 2, 3, 6, 227, 454, 681, 1362

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10101010010

Octal: 2522

Duodecimal: 956

Hexadecimal: 552

Square: 1855044

Square Root: 36.90528417449187

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

Coordination sequence for "crs" 3D uniform tiling formed from tetrahedra and truncated tetrahedra. A299268

a(1) = 0; and for n > 1, a(n) = A033879(A156552(n)). A323244

Numbers m such that the Bernoulli number B_m has denominator 42. A51228

Numbers k whose abundance is 12: σ(k) - 2·k = 12. A141545

Number of partitions of n such that every part divides the largest part; a(0) = 1. A130689

Numbers k such that (1) the k-th composition in standard order contains no 1's, and (2) there is no composition whose first sums are the k-th composition in standard order. A390678

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) - m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 1, read by rows. A157210

a(n) = floor(n*φ⁸), where φ is the golden ratio, A001622. A4923

a(n) = |{m : multiplicative order of 3 mod m = n}|. A59885

First differences of the central Delannoy numbers (A001850). A110170