10324
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18900
- Proper Divisor Sum (Aliquot Sum)
- 8576
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4928
- Möbius Function
- 0
- Radical
- 5162
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 104
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of 3-line partitions of n.at n=18A000991
- Positive numbers k such that k and 3*k are anagrams in base 6 (written in base 6).at n=1A023065
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 4.at n=32A025010
- a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+1), with T given by A026747.at n=6A027224
- a(n) = A061086(n) / n.at n=17A061087
- Nearest integer to log(n)^sqrt(n).at n=46A062464
- a(n) = Sum_{1 <= x, y <= n} lcm(x, y).at n=14A064951
- Sum of decimal digits of square of divisors of n equals sum of square of digits of n.at n=39A067344
- Least k for the Theodorus spiral to complete n revolutions.at n=31A072895
- List of codewords in binary lexicode with Hamming distance 5 written as decimal numbers.at n=33A075931
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; then a(n) is the number of partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p <= A000230(n).at n=41A079023
- Number of numbers that are ternary squarefree words of length n.at n=27A088953
- a(n)=number of Catalan knight paths in right half-plane from (0,0) to (n,0).at n=12A096609
- Largest achievable determinant of a 4 X 4 matrix whose elements are 16 distinct integers chosen from the range -n...n.at n=0A097695
- Number of ways to write n! as product of squarefree numbers.at n=12A103774
- Number of permutations of length n which avoid the patterns 1432, 2314, 2413.at n=8A116736
- Numbers k such that k and k^2 together contain all ten digits.at n=30A122477
- Ramanujan numbers (A000594) read mod 16384.at n=10A126824
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n)*Sum[Binomial[n-m, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=51A146773
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n)*Sum[Binomial[n-m, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=48A146773