11650
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21762
- Proper Divisor Sum (Aliquot Sum)
- 10112
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4640
- Möbius Function
- 0
- Radical
- 2330
- Omega Function (Ω)
- 4
- 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
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 generalized difference set on the set of all integers (lambda = 2).at n=22A049399
- INVERT transform of A052879.at n=9A052836
- a(1)=2; for n>1, a(n)=2*a(n-1)-1 if that number is composite, a(n)=a(n-1)+1 otherwise.at n=21A081869
- Numbers k such that 2^k - 11 is prime.at n=13A096817
- Numbers n such that (273*2^n-1)^2-2 is prime.at n=43A100913
- Self-convolution 7th power equals A106226, which consists entirely of digits {0,1,2,3,4,5,6} after the initial terms {1,7}.at n=7A106227
- Number of permutations of floor(i*7/4), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=7A147903
- Number of permutations of floor(i*7/4), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147912
- Total sum of number of lambda-parking functions, where lambda ranges over all partitions of n into distinct parts.at n=16A265016
- p-INVERT of the positive integers, where p(S) = 1 - S^5.at n=11A290893
- p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - S^5.at n=23A291218
- Floor of area of quadrilateral with consecutive prime sides configured as a cyclic quadrilateral.at n=26A329950
- Numbers whose base phi representation is symmetrical with respect to the radix point.at n=37A330672
- a(n) is the smallest number > 1 whose base n digits yield the original number when added and multiplied left to right; or 0 if no such number exists.at n=30A334916
- a(1) = 15; for n > 1, a(n)^2 is the smallest square that begins with a(n-1) in base 6.at n=15A336251
- Total sum of parts which are squares in all partitions of n.at n=24A342228
- Numbers m such that d(1)^1 + d(2)^2 + ... + d(p)^k = d(1)! + d(2)! + ... + d(k)!, where d(i), i=1..k, are the digits of m.at n=25A342945
- G.f. A(x) satisfies: A(x)^7 = A(x^7) + 7*x.at n=7A352705
- G.f. A(x) satisfies: (1 - x*A(x))^7 = 1 - 7*x - x^7*A(x^7).at n=6A352706
- Expansion of (1/x) * Series_Reversion( x*(1+x-x^3)/(1+x)^3 ).at n=8A366096