11630
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20952
- Proper Divisor Sum (Aliquot Sum)
- 9322
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4648
- Möbius Function
- -1
- Radical
- 11630
- 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
- 143
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = (n^6 + 2n^5 + 2n^4 + n^3 + 2n)/2.at n=4A163279
- 5 times centered pentagonal numbers: 5*(5*n^2 + 5*n + 2)/2.at n=30A164015
- Row sums of triangle A156070.at n=16A188538
- Number of right triangles on an (n+1) X 5 grid.at n=19A189809
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=32A229467
- Integers m such that A006218(m) is triangular.at n=45A263457
- Numbers k such that (238*10^k - 1)/3 is prime.at n=23A273542
- Numbers k such that (14*10^k - 143)/3 is prime.at n=20A279050
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) - b(n-2) + n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=16A294423
- Number of integer partitions of n with more than one part of least multiplicity.at n=35A362609
- a(n) = Sum_{k=1..n} binomial(k+2,2) * floor(n/k).at n=35A366984
- a(n) = (7*n^2-5*n+2)/2.at n=58A389608