Properties of the Number 15047

Fifteen Thousand Forty-Seven

Basics

Value: 15046 → 15047 → 15048

Parity: odd

Prime: No

Previous Prime: 15031

Next Prime: 15053

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 41 × 367

Divisors: 1, 41, 367, 15047

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11101011000111

Octal: 35307

Duodecimal: 885B

Hexadecimal: 3ac7

Square: 226412209

Square Root: 122.66621376727987

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

Composite numbers generated by the Euler polynomial x² + x + 41. A145292

Number of n-node unlabeled connected graphs with one cycle of length 3. A226

Semiprimes generated by the Euler polynomial x² + x + 41. A228183

Number of unlabeled series-reduced rooted trees with n nodes where the non-leaf branches directly under any given node are all equal. A320268

a(n) = n*(9·n-2). A13656

Prime-generating polynomial: a(n) = 16·n² - 300·n + 1447. A181973

Number of compositions (ordered partitions) of n into distinct parts >= 7. A339108

Numerators of the characteristic polynomials of the von Mangoldt function matrix. A260237

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

a(n) is the sum of all distinct integers that can be produced by reversing the digits of n in any base b >= 2. A211518