11670
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28080
- Proper Divisor Sum (Aliquot Sum)
- 16410
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3104
- Möbius Function
- 1
- Radical
- 11670
- Omega Function (Ω)
- 4
- 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
- 81
- 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
- Numbers k such that sigma(k) = sigma(k+12).at n=39A015882
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 36.at n=5A031714
- Positive numbers having the same set of digits in base 9 and base 10.at n=39A037443
- Number of triangular regions in regular n-gon with all diagonals drawn.at n=27A062361
- Number of one-element transitions among all integer partitions of the integers from m=0 to m=n in the unlabeled case.at n=16A096586
- Triangle read by rows: T(n,k) is the coefficient of t^k (k >= 1) in the polynomial P[n,t] defined by P[1,t] = P[2,t] = t, P[n,t] = P[n-1,t] + P^2[n-2,t].at n=54A103484
- a(n) = A121680(n)/(n+1) = [x^n] (1 + x*(1+x)^(n+1) )^(n+1) / (n+1).at n=6A121681
- Triangle of coefficients of even modified recursive orthogonal Hermite polynomials given in Hochstadt's book:P(x, n) = x*P(x, n - 1) - n*P(x, n - 2) ;A137286; P2(x,n)=P(x,n)+P(x,n-2).at n=57A136586
- a(n) = 36*n^2 + 6.at n=17A158479
- Least integer b > F(n) such that sum_{k=1}^n F(k)*b^{k-1} is prime, where F = A000045.at n=19A224487
- Number of nX4 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=3A240409
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=24A240412
- Number of 4Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=3A240415
- Numbers n such that n^3+prime(n) and n^3-prime(n) are prime.at n=27A257788
- Least positive integer k such that (k-1)^2+(k*n)^2, k^2+(k*n-1)^2, (k+1)^2+(k*n)^2 and k^2+(k*n+1)^2 are all prime.at n=51A261382
- Partial sums of A019565.at n=46A288570
- Numbers k such that Bernoulli number B_{k} has denominator 14322.at n=13A295588
- The smallest number whose prime factor concatenation, when written in base n, contains all digits 0,1,...,(n-1).at n=5A372309