10466
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15702
- Proper Divisor Sum (Aliquot Sum)
- 5236
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5232
- Möbius Function
- 1
- Radical
- 10466
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 29
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Aliquot sequence starting at 180.at n=20A008891
- Sum of squares of the first n primes.at n=14A024450
- n for which floor((3/2)^n) is prime.at n=23A070759
- Numbers n such that A065863(n) = 1, i.e., prime(n) mod (n - Pi(n)) = 1.at n=19A072623
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=46A081738
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=47A081738
- Number of (3412,1234)-avoiding involutions in S_n.at n=26A085583
- Number of partitions of n with at most 3 odd parts.at n=41A114312
- a(n) = Sum_{k=1..n} J_4(k)/240.at n=21A115003
- Number of (n+1) X (n+1) -3..3 symmetric matrices with every 2 X 2 subblock having sum zero and two or three distinct values.at n=8A211325
- O.g.f.: exp( Sum_{n>=1} (sigma(2*n^4) - sigma(n^4)) * x^n/n ).at n=6A224902
- Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock equal.at n=2A237093
- Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock equal.at n=1A237094
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock equal.at n=7A237099
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock equal.at n=8A237099
- Sum of primes between 100*n and 100*n + 99.at n=7A276355
- Expansion of Product_{k>=1} 1/(1 - x^(k^2))^2.at n=49A279225
- Number of integer partitions of n with frequency depth floor(sqrt(n)).at n=37A325252
- Number of integer partitions of n with the maximum adjusted frequency depth for partitions of n.at n=37A325254
- Number of integer partitions of n with frequency depth round(sqrt(n)).at n=37A325271