11683
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13360
- Proper Divisor Sum (Aliquot Sum)
- 1677
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10008
- Möbius Function
- 1
- Radical
- 11683
- 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
- 81
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 9 (most significant digit on right and removing all least significant zeros before concatenation).at n=9A029526
- Numbers ending with '3' that are the difference of two positive cubes.at n=25A038858
- Number of compositions of the integer n with strictly smallest part in the first position.at n=22A079501
- a(n) = least k such that the remainder when 12^k is divided by k is n.at n=46A127820
- Difference between largest number of complexity n in the sense of A005245 and smallest number of complexity n in the sense of A005245.at n=25A133374
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (0, 1, 0), (1, 1, 0)}.at n=9A149854
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 0, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150777
- Column 4 of triangle A152798; a(n) = A152798(n+4,4).at n=8A152809
- a(n+1) is the smallest integer > a(n) such that the concatenation of a(n), [a(n+1)-a(n)] and a(n+1) is a prime number.at n=56A173700
- Number of (w,x,y,z) with all terms in {1,...,n} and w^2<x*y*z.at n=11A212063
- Conjecturally, the largest k such that prime(n)^2 is the largest squared prime divisor of binomial(2k,k).at n=31A239623
- Number of partitions of n such that the number of even parts is a part or the number of odd parts is a part.at n=36A240576
- a(n) = (n+1)^3 - n^2.at n=22A261893
- Expansion of (x^5-2*x^4+2*x^3-x+1)/(x^4-2*x^3+3*x^2-3*x+1).at n=16A271827
- a(n) = number of regions in the configuration A290447(n).at n=24A290865
- Number of integer compositions of n that are weakly alternating and have at least two adjacent equal parts.at n=17A349800
- Number of integer partitions of n such that (length) * (maximum) <= 2*n.at n=44A361851
- a(n) is the number of ones in the binary expansion of 10^(10^n).at n=4A379446
- G.f.: Sum_{k>=0} x^k * Product_{j=1..6*k} (1 + x^j)/(1 - x^j).at n=19A385092