11468
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20832
- Proper Divisor Sum (Aliquot Sum)
- 9364
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 0
- Radical
- 5734
- 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
- 29
- 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
- Coordination sequence for CaF2(1), Ca position.at n=36A009923
- a(0) = 1, a(n) = 26*n^2 + 2 for n>0.at n=21A010016
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.at n=17A050793
- Ramanujan's b-series: expansion of (2-26x-12x^2)/(1-82x-82x^2+x^3).at n=2A051029
- Numbers k such that k^512 + 1 is prime.at n=32A057465
- n*10^2-1, n*10^2-3, n*10^2-7 and n*10^2-9 are all prime.at n=20A064976
- An inverse Chebyshev transform of the Pell numbers.at n=10A100097
- Integers that are Rhonda numbers to base 15.at n=2A100974
- Expansion of g.f. x*(1+x+2*x^2+2*x^3+5*x^4+5*x^5-3*x^6+2*x^7-x^8-x^9)/(1-6*x^6-x^12).at n=32A116559
- Binomial transform of the characteristic function of the prime numbers (A010051).at n=15A121497
- a(n) = 2*a(n-1) - a(n-2) + 2*a(n-3), with a(0) = 2, a(1) = 2.at n=13A135541
- Number of permutations of floor(i*4/3), i=0..n-1, with all sums of two adjacent terms unique.at n=7A147917
- Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A033543.at n=38A171515
- Number of nondecreasing arrangements of 6 numbers x(i) in -(n+4)..(n+4) with the sum of sign(x(i))*x(i)^2 zero.at n=16A188006
- a(n) = 6*a(n-2) + a(n-4), where a(0) = 2, a(1) = 8, a(2) = 13, a(3) = 49.at n=9A228469
- a(n) = 6*a(n-2) + a(n-4), where a(0) = 5, a(1) = 8, a(2) = 30, a(3) = 49.at n=9A228472
- Number of simple connected graphs with n nodes and exactly 2 articulation points (cutpoints).at n=8A241768
- Numerators of continued fraction convergents to sqrt(10)/2 = sqrt(5/2) = A020797 + 1.at n=15A295333
- a(n) equals the coefficient of x^n in Sum_{m>=0} (x^m + 1/x^m)^m for n > 0.at n=31A304638
- a(n) equals the coefficient of x^n in Sum_{m>=0} (x^m + 2 + 1/x^m)^m for n >= 1.at n=7A316592