Properties of the Number 1349

One Thousand Three Hundred Forty-Nine

Basics

Value: 1348 → 1349 → 1350

Parity: odd

Prime: No

Previous Prime: 1327

Next Prime: 1361

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 19 × 71

Divisors: 1, 19, 71, 1349

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10101000101

Octal: 2505

Duodecimal: 945

Hexadecimal: 545

Square: 1819801

Square Root: 36.72873534441391

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

Number of separable partitions of n; see Comments. A325534

Number of strict integer partitions of n such that some part can be written as a nonnegative linear combination of the others. A364839

Number of non-condensed integer partitions of n, or partitions where it is not possible to choose a different divisor of each part. A370320

Numbers k such that k² has an odd number of digits and the middle digit is 9. A279429

a(n) = Lucas(n+1) - (n+1). A66982

T(n,k) is the number of strings of numbers x(i=1..n) in 0..k with sum i·x(i) equal to k·n. A184703

Numbers k such that σ(k) = σ(k+8). A15876

a(n) = 6·n² - 1. A140811

Triangle, T(n, k): T(n,k) = 1 for n < 3, T(3,1) = T(3,2) = T(3,3) = 2, T(n,0) = 1, T(n,1) = n-1, T(n,n) = T(n-1,n-2) + T(n-1,n-1), otherwise T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k), read by rows. A26268

Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n³ + 3·n² + 8·n)/6 (n > 0). A3600