Properties of the Number 1385

One Thousand Three Hundred Eighty-Five

Basics

Value: 1384 → 1385 → 1386

Parity: odd

Prime: No

Previous Prime: 1381

Next Prime: 1399

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 277

Divisors: 1, 5, 277, 1385

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101101001

Octal: 2551

Duodecimal: 975

Hexadecimal: 569

Square: 1918225

Square Root: 37.21558813185679

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

Euler or up/down numbers: e.g.f. sec(x) + tan(x). Also for n >= 2, half the number of alternating permutations on n letters (A001250). A111

Euler (or secant or "Zig") numbers: e.g.f. (even powers only) sec(x) = 1/cos(x). A364

Euler (or secant) numbers E(n). A122045

Nonzero coefficients of the Swiss-Knife polynomials for the computation of Euler, tangent, and Bernoulli numbers (triangle read by rows). A153641

Triangle read by rows, T(n,k) = binomial(n,k)*A000111(n-k), 0 <= k <= n. A109449

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 4.6.12 2D tiling (cf. A072154). A299258

Expansion of e.g.f. Gudermannian(x) = 2·arctan(exp(x)) - π/2. A28296

Numbers m such that the Bernoulli number B_2·m has denominator 66. A51229

a(n) = least k such that the remainder when 32^k is divided by k is n. A128372

Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1. A8282