Properties of the Number 1515

One Thousand Five Hundred Fifteen

Basics

Value: 1514 → 1515 → 1516

Parity: odd

Prime: No

Previous Prime: 1511

Next Prime: 1523

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 101

Divisors: 1, 3, 5, 15, 101, 303, 505, 1515

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10111101011

Octal: 2753

Duodecimal: A63

Hexadecimal: 5eb

Square: 2295225

Square Root: 38.92300091205713

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

Doublets: base-10 representation is the juxtaposition of two identical strings. A20338

Number of positive subset sums of strict integer partitions of n. A284640

Number of integer partitions of n containing three parts (a,b,c) (repeats allowed) such that a + b = c. A variation of sum-full partitions. A363225

Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1); triangle T(n,k), n>=0, read by rows. A243752

Multiples of 15 containing a 15 in their decimal representation. A121035

a(n) = 3*(2ⁿ-1) - 2·n. A50488

Sum of first n nonprimes. A51349

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 1, read by rows. A157147

a(n) = 2·n² - 2·n + 3. A97080

Triangle read by rows: T(n,k) = number of nonisomorphic unlabeled connected graphs with n nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2). A54924