11700
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 54
- Divisor Sum
- 39494
- Proper Divisor Sum (Aliquot Sum)
- 27794
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2880
- Möbius Function
- 0
- Radical
- 390
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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
- Theta series of direct sum of 3 copies of hexagonal lattice.at n=28A008654
- Theta series of direct sum of 3 copies of hexagonal lattice.at n=21A008654
- Fibonacci sequence beginning 3, 10.at n=16A022122
- a(n) = 1*(n+3-1) + 2*(n+3-2) + .... + k*(n+3-k), where k=floor((n+1)/2).at n=49A023857
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3).at n=48A024854
- Denominators of continued fraction convergents to sqrt(326).at n=3A041615
- b(n)*b(2*n), b(n) = A001353(n+1).at n=2A052209
- Numbers n such that x^n + x^13 + 1 is irreducible over GF(2).at n=16A057483
- a(n) = n * next number greater than n with same first digit as n.at n=38A060317
- Numbers m such that m*tau(m)>5*prime(m).at n=25A068547
- Numbers k such that (k-1, k+1) and (k/2-1, k/2+1) are both pairs of twin primes.at n=8A076504
- a(0) = 1, a(n) = 20*sigma[3](n).at n=8A091983
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k subwords of the type uh^ju, dH^jd, or dh^ju for some j>0, where u=(1,1), d=(1,-1) and h=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=44A098056
- Number of points of self-intersection of the path of a billiard ball traveling at a 45-degree angle on a prime(n) X prime(n+1) billiard table. Also equal to 1/2 the number of the lattice points lying within a prime(n) X prime(n+1) rectangle.at n=35A099407
- Numbers n such that 6*10^n + R_n + 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=13A103027
- Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k returns to the x-axis (i.e., d or u steps hitting the x-axis).at n=43A109193
- Inverse of Riordan array (1/(1-x), x/(1-x)^3), A109955.at n=50A109956
- Exponential aspiring numbers.at n=17A127658
- Exponential abundant numbers: integers k for which A126164(k) > k, or equivalently for which A051377(k) > 2k.at n=13A129575
- a(n) = the smallest positive integer with exactly n positive "isolated divisors". A divisor, k, of n is isolated if neither (k-1) nor (k+1) divides n.at n=41A133997