10489
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11124
- Proper Divisor Sum (Aliquot Sum)
- 635
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9856
- Möbius Function
- 1
- Radical
- 10489
- 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
- 55
- Smith Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Molien series for alternating group Alt_12 (or A_12).at n=35A008635
- Number of partitions of n into at most 12 parts.at n=35A008641
- Indices of prime Mersenne numbers (A001348).at n=28A016027
- Numbers k such that the continued fraction for sqrt(k) has period 63.at n=14A020402
- Number of partitions of n into parts not of the form 19k, 19k+9 or 19k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=35A035978
- Numbers k such that (k!)^2 + prime(k) is prime.at n=11A064769
- a(n) = n*(14*n^2 - 21*n + 13)/6.at n=17A071229
- Partial sums of A034953(n).at n=17A085739
- Total number of perfect powers > 1 below 10^n.at n=7A089579
- Table T(n,k) = sum over all set partitions of n of number at index k.at n=31A120057
- a(n) = 16 + floor(Sum_{j=1..n-1} a(j)/2).at n=16A120142
- a(n) = k: k is smallest integer > 1 such that sign(d(1)-d(2)) = sign(d(k)-d(k+1)), sign(d(2)-d(3)) = sign(d(k+1)-d(k+2)),...,sign(d(n)-d(n+1)) = sign(d(k+n-1)-d(k+n)), where sign is (-,0,+) and d(m) = the number of positive divisors of m.at n=15A137947
- a(n) = k: k is smallest integer > 1 such that sign(d(1)-d(2)) = sign(d(k)-d(k+1)), sign(d(2)-d(3)) = sign(d(k+1)-d(k+2)),...,sign(d(n)-d(n+1)) = sign(d(k+n-1)-d(k+n)), where sign is (-,0,+) and d(m) = the number of positive divisors of m.at n=14A137947
- a(n) = k: k is smallest integer > 1 such that sign(d(1)-d(2)) = sign(d(k)-d(k+1)), sign(d(2)-d(3)) = sign(d(k+1)-d(k+2)),...,sign(d(n)-d(n+1)) = sign(d(k+n-1)-d(k+n)), where sign is (-,0,+) and d(m) = the number of positive divisors of m.at n=16A137947
- a(n) = k: k is smallest integer > 1 such that sign(d(1)-d(2)) = sign(d(k)-d(k+1)), sign(d(2)-d(3)) = sign(d(k+1)-d(k+2)),...,sign(d(n)-d(n+1)) = sign(d(k+n-1)-d(k+n)), where sign is (-,0,+) and d(m) = the number of positive divisors of m.at n=21A137947
- a(n) = k: k is smallest integer > 1 such that sign(d(1)-d(2)) = sign(d(k)-d(k+1)), sign(d(2)-d(3)) = sign(d(k+1)-d(k+2)),...,sign(d(n)-d(n+1)) = sign(d(k+n-1)-d(k+n)), where sign is (-,0,+) and d(m) = the number of positive divisors of m.at n=20A137947
- a(n) = k: k is smallest integer > 1 such that sign(d(1)-d(2)) = sign(d(k)-d(k+1)), sign(d(2)-d(3)) = sign(d(k+1)-d(k+2)),...,sign(d(n)-d(n+1)) = sign(d(k+n-1)-d(k+n)), where sign is (-,0,+) and d(m) = the number of positive divisors of m.at n=19A137947
- a(n) = k: k is smallest integer > 1 such that sign(d(1)-d(2)) = sign(d(k)-d(k+1)), sign(d(2)-d(3)) = sign(d(k+1)-d(k+2)),...,sign(d(n)-d(n+1)) = sign(d(k+n-1)-d(k+n)), where sign is (-,0,+) and d(m) = the number of positive divisors of m.at n=18A137947
- a(n) = k: k is smallest integer > 1 such that sign(d(1)-d(2)) = sign(d(k)-d(k+1)), sign(d(2)-d(3)) = sign(d(k+1)-d(k+2)),...,sign(d(n)-d(n+1)) = sign(d(k+n-1)-d(k+n)), where sign is (-,0,+) and d(m) = the number of positive divisors of m.at n=17A137947
- a(n) = k: k is smallest integer > 1 such that sign(d(1)-d(2)) = sign(d(k)-d(k+1)), sign(d(2)-d(3)) = sign(d(k+1)-d(k+2)),...,sign(d(n)-d(n+1)) = sign(d(k+n-1)-d(k+n)), where sign is (-,0,+) and d(m) = the number of positive divisors of m.at n=13A137947