Properties of the Number 15350

Fifteen Thousand Three Hundred Fifty

Basics

Value: 15349 → 15350 → 15351

Parity: even

Prime: No

Previous Prime: 15349

Next Prime: 15359

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 ² × 307

Divisors: 1, 2, 5, 10, 25, 50, 307, 614, 1535, 3070

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101111110110

Octal: 35766

Duodecimal: 8A72

Hexadecimal: 3bf6

Square: 235622500

Square Root: 123.89511693363868

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

Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from top row to lower right corner, and no 1 having more than two 1's adjacent. A391823

E.g.f.: exp(-exp(-x)+1+x). A109747

Smallest even number k such that lpf(k-3) = prime(n) while lpf(k-1) > lpf(k-3), where lpf=least prime factor (A020639). A242490

a(n) = 3·a(n-1) - 2·a(n-2) with a(0)=20 and a(1)=50. A182462

a(n) = ∑_i=0..n digsum(i)⁴, where digsum(i) = A007953(i). A231689

Solution of the complementary equation a(n) = 2·a(n-1) + a(n-2) + b(n), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296849

Number of n X 6 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent. A163699

Number of n X 5 binary arrays with all 1s connected, a path of 1s from left column to lower right corner, and no 1 having more than two 1s adjacent. A163707

Indices of primes followed by a gap (distance to next larger prime) of 42. A320719

a(n)=a(n-1)+a(n-2)-d, where d=a(n/2) if n is even, else d=0; 2 initial terms. A50192