11740
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
- 24696
- Proper Divisor Sum (Aliquot Sum)
- 12956
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4688
- Möbius Function
- 0
- Radical
- 5870
- 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
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 88.at n=31A020427
- 17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.at n=40A051869
- Centered 13-gonal numbers.at n=42A069126
- Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)) and M(k) = Max_{i<=i<=k} u(i), then for any k >= A078109(n), M(k) = floor(sqrt(k + a(n))).at n=18A078108
- Number of partitions of n with no even parts repeated and with no 1's.at n=54A117275
- Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} (or of any n-set) having k blocks of odd size (0<=k<=n).at n=48A124321
- Numbers n such that prime[(n + 1)^2] - prime[n^2] is a perfect square.at n=22A145290
- Number of (n+2) X (5+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=5A253507
- Number of (n+2)X(6+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=4A253508
- Numbers n such that n*2^1279 - 1 is prime.at n=31A265502
- G.f.: 1/((1-t^8)*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^9)*(1-t^11)*(1-t^13)*(1-t^15)).at n=63A266748
- Numbers n such that Bernoulli number B_{n} has denominator 330.at n=32A272183
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) -1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=38A294867
- a(n) is the number of subsets of {1, 2, ..., n} with product of all entries <= n^2 + n.at n=50A298880
- Numbers k such that k^2 reversed is a prime and k^2+(k^2 reversed) is a prime.at n=29A306301
- G.f. A(x) satisfies: A(x) = 1 + Sum_{k>=1} x^k*A(x)^k/(1 + x^k*A(x)^k).at n=11A307397
- Positive integers that have exactly nine representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=13A317399
- Number of (binary) max-heaps on n elements from the set {0,1} containing exactly seven 0's.at n=22A326508
- Iteration of Abelian sandpile model where the n-th matrix expansions occurs. Begins with infinite sand in 1 X 1 matrix.at n=44A328506
- Numbers k such that k and k + 1 are both binary Smith numbers (A278909).at n=41A331464