Properties of the Number 15069

Fifteen Thousand Sixty-Nine

Basics

Value: 15068 → 15069 → 15070

Parity: odd

Prime: No

Previous Prime: 15061

Next Prime: 15073

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5023

Divisors: 1, 3, 5023, 15069

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101011011101

Octal: 35335

Duodecimal: 8879

Hexadecimal: 3add

Square: 227074761

Square Root: 122.75585525749882

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

Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2·j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows. A153656

a(n) is the number of integer partitions of n for which the greatest part minus the least part is equal to the index of the seaweed algebra formed by the integer partition paired with its weight. A318176

Numbers k such that k⁴ contains a pandigital substring. A115934

Number of indecomposable permutations sortable by a double-ended queue. A215257

a(n) = ∑_{k=0..floor(n/3)} 2^k * binomial(2·n-4·k,2·k). A387622

Expansion of ∏_k>=1 1/(1 - φ(k)*x^k), where φ = Euler totient function (A000010). A319111

Self-convolution of n-th antidiagonal of the natural number array (so named in the Comments section of A000027). A387429

a(n) = sigma₃(n) - sigma₂(n) - sigma₁(n). A92350

Numbers n such that 8ⁿ-7^n-1 is prime. A272345

Apply partial sum operator twice to binary rooted tree numbers. A14168