Properties of the Number 1513

One Thousand Five Hundred Thirteen

Basics

Value: 1512 → 1513 → 1514

Parity: odd

Prime: No

Previous Prime: 1511

Next Prime: 1523

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 17 × 89

Divisors: 1, 17, 89, 1513

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10111101001

Octal: 2751

Duodecimal: A61

Hexadecimal: 5e9

Square: 2289169

Square Root: 38.897300677553446

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

Centered square numbers: a(n) = 2·n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values. A1844

Number of non-Look-and-Say partitions of n. Number of integer partitions of n such that there is no way to choose a disjoint strict integer partition of each multiplicity. A351293

Number of "ON" cells at n-th stage in the "Ulam-Warburton" two-dimensional cellular automaton. A147562

Generalized 12-gonal numbers: k*(5·k-4) for k = 0, +-1, +-2, ... A195162

Numbers that are the sum of 6 positive 5th powers. A3351

Generalized 13-gonal numbers: m*(11·m-9)/2 with m = 0, 1, -1, 2, -2, 3, -3, ... A195313

13-gonal (or tridecagonal) numbers: a(n) = n*(11·n - 9)/2. A51865

Number of permutations of length 3n with descent set {3, 6, ...} that avoid a certain pattern of length 4 or 5 (see Lewis, 2012, Appendix, for precise definition). A217830

a(n) = 8·n² - 4·n + 1. A80856

Number of T₀ integer partitions of n. A319564