Properties of the Number 15393

Fifteen Thousand Three Hundred Ninety-Three

Basics

Value: 15392 → 15393 → 15394

Parity: odd

Prime: No

Previous Prime: 15391

Next Prime: 15401

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 733

Divisors: 1, 3, 7, 21, 733, 2199, 5131, 15393

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110000100001

Octal: 36041

Duodecimal: 8AA9

Hexadecimal: 3c21

Square: 236944449

Square Root: 124.06852945046137

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

Numbers k such that 4·5^k - 1 is prime. A46865

T(n,k) is the number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors. A200886

Number of non-strict integer partitions of n with at least one part of odd multiplicity that is not the first or last. A349796

a(n) = (p(n)*p(n+1)-p(n+2))/2, where p(n) is the n-th odd prime. A152527

The number of hanging vertically stable self-avoiding walks of length n on a 2D square lattice where both the nodes and connecting rods have mass. A335780

Triangle read by rows: T(n,k) is the number of bicolored cubic graphs on 2n unlabeled vertices with k vertices of the first color, n >= 0, 0 <= k <= 2·n. A361361

a(n) = floor(surface area of a sphere with radius n). A66644

Total sum of odd parts in the last section of the set of partitions of n. A206435

Triangle of coefficients of polynomials u(n,x) jointly generated with A209774; see the Formula section. A209773

Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1). A357694