Properties of the Number 15494

Fifteen Thousand Four Hundred Ninety-Four

Basics

Value: 15493 → 15494 → 15495

Parity: even

Prime: No

Previous Prime: 15493

Next Prime: 15497

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 61 × 127

Divisors: 1, 2, 61, 122, 127, 254, 7747, 15494

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110010000110

Octal: 36206

Duodecimal: 8B72

Hexadecimal: 3c86

Square: 240064036

Square Root: 124.47489706764172

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 integer partitions of n with no adjacent parts having quotient > 2. A342094

Number of ways to choose a multiset of strict partitions, or odd partitions, of odd numbers, whose weights sum to n. A300300

Numbers k such that 7·2^k+1 is prime. A32353

Möbius transform of A332223. A332463

Satisfies a(n)/A079159(n) = p_n, the n-th prime (n>0), a(0)=1. A79161

Number of nX7 0..1 arrays with every element equal to 0, 2, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303324

a(n) = (5·n+2)*(5·n+7). A85036

A general recursion sequence:m=8:Half tent function: f(n,m)== Min[1 + Floor[m/2], 1 + Floor[(n - m)/2]]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m·k + 1)*A(n - 1, k, m) + m·f(n, k)*A(n - 2, k - 1, m). A157453

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303325

Inverse of 1485th cyclotomic polynomial. A15494