10329
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15072
- Proper Divisor Sum (Aliquot Sum)
- 4743
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- -1
- Radical
- 10329
- Omega Function (Ω)
- 3
- 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
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(19*n - 1)/2.at n=33A022276
- Expansion of Product_{m>=1} (1+q^m)^(-11).at n=8A022606
- Numbers of the form p*q*r where p,q,r are distinct odd palindromic primes (odd terms from A002385).at n=38A046405
- Number of columns in the character table of the symmetric group S_n that have zero sum.at n=33A085642
- Numbers k such that p(k), p(k)+6, p(k)+12, p(k)+18 are consecutive primes, where p(k) denotes k-th prime.at n=40A090832
- Numbers n such that p(n),p(n)+6,p(n)+12,p(n)+18 are consecutive primes and p(n)=6*k+1 for some k, where p(n) denotes n-th prime.at n=20A090838
- Number of disconnected 3-regular simple graphs on 2n vertices with girth exactly 4.at n=12A185034
- Number of alternating permutations on 2n letters that avoid a certain pattern of length 4 (see Lewis, 2012, Appendix, for precise definition).at n=4A217811
- Number of distinct values of the sum of i^2 over 9 realizations of i in 0..n.at n=34A225276
- Number of triforces generated at iteration n in a Koch-Sierpiński Ninja Star.at n=9A250128
- Number of nX2 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors.at n=6A283124
- Number of nX7 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors.at n=1A283129
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors.at n=29A283130
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors.at n=34A283130
- T(n,k) = Number of n X k 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors.at n=34A283691
- Number of 7Xn 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors.at n=1A283697
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 7.at n=53A284780
- a(1) = a(2) = 1; a(n) = ( Sum_{i|(n-1)} a(i) ) + Sum_{j|(n-2)} a(j).at n=17A293636
- Number of nX7 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 1, 2 or 4 1s.at n=1A295715
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 1, 2 or 4 1s.at n=29A295716