Properties of the Number 10395

Ten Thousand Three Hundred Ninety-Five

Basics

Value: 10394 → 10395 → 10396

Parity: odd

Prime: No

Previous Prime: 10391

Next Prime: 10399

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 7 × 11

Divisors: 1, 3, 5, 7, 9, 11, 15, 21, 27, 33

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100010011011

Octal: 24233

Duodecimal: 6023

Hexadecimal: 289b

Square: 108056025

Square Root: 101.95587280779857

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

Double factorial of odd numbers: a(n) = (2·n-1)!! = 1·3*5*...*(2·n-1). A1147

Double factorials n!!: a(n) = n·a(n-2) for n > 1, a(0) = a(1) = 1. A6882

Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m). A5231

The convolution matrix of the double factorial of odd numbers (A001147). A35342

Least number with exactly n odd divisors. A38547

Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n). A100861

Triangle of coefficients of Bessel polynomials (exponents in decreasing order). A1497

Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order). A1498

Triangle of Bessel numbers read by rows. Row n gives T(n,n), T(n,n-1), T(n,n-2), ..., T(n,1) for n >= 1. A111924

Triangle T(n,k) of associated Stirling numbers of second kind, n >= 2, 1 <= k <= floor(n/2). A8299