Properties of the Number 15369

Fifteen Thousand Three Hundred Sixty-Nine

Basics

Value: 15368 → 15369 → 15370

Parity: odd

Prime: No

Previous Prime: 15361

Next Prime: 15373

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 47 × 109

Divisors: 1, 3, 47, 109, 141, 327, 5123, 15369

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110000001001

Octal: 36011

Duodecimal: 8A89

Hexadecimal: 3c09

Square: 236206161

Square Root: 123.97177098033245

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

a(n) = 13·n² + 10·n + 1. A161587

Number of odd strict trees of weight n (all outdegrees are odd). A300440

Monotonic ordering of nonnegative differences 5ⁱ-2^j, for 40>=i>=0, j>=0. A192115

Monotonic ordering of nonnegative differences 5ⁱ-4^j, for 40>= i>=0, j>=0. A192162

Triangle T(n, k) = ( k*(n-k+1) )³ - 2^n-1, read by rows. A141388

Primes in a millennium reach a record minimum: numbers n such that A038823(n) is lower than all A038823(k) with k<n. A157082

Numbers k such that 2^k + 2·k - 3 is prime. A392535

Gaussian binomial coefficient [ n,8 ] for q=-12. A15369

a(n) is the smallest number such that a(n)*n is an anagram of a(n) * 7. A175696

T(1, c) = prime(c). T(r + 1, c) = (T(r, c') + T(r, c'+1)) / 2 where c' is the c-th number such that T(r, c') + T(r, c'+1) is even. Table for T read downwards by antidiagonals. A287943