11634
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
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26688
- Proper Divisor Sum (Aliquot Sum)
- 15054
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3312
- Möbius Function
- 1
- Radical
- 11634
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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
- G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 13 generated by (1,2,...,13).at n=7A036730
- Numbers k such that 289*2^k + 1 is prime.at n=7A053361
- a(n) = |{m : multiplicative order of 9 mod m = n}|.at n=43A059891
- Let f(n) be 2n + POD(n) + 1 if n is even, otherwise 2n - POD(n) - 1, where POD(n) is the product of digits of n. Sequence gives smallest number requiring n iterations to reach a prime.at n=44A074808
- Integer part of the area of consecutive prime sided tetragons with one right angle.at n=27A105270
- a(n) is the maximal positive integer m for which exponents of prime(n) and prime(n+1) in the prime power factorization of m! are both powers of 2.at n=38A177498
- Least m>0 such that prime(n) divides S(m)=A007908(m)=123...m and all numbers obtained by cyclic permutations of its digits; 0 if no such m exists.at n=34A181373
- Third accumulation array, T, of the natural number array A000027, by antidiagonals.at n=48A185508
- Number of right triangles on an (n+1) X 3 grid.at n=41A189807
- Beastly reciprocals, or numbers k such that digitsum(1/k) = 666.at n=26A244661
- Triangle read by rows: T(n,k) is the number of parking functions of length n whose maximum element is k, where n >= 0 and 0 <= k <= n.at n=32A260693
- Numbers k such that (13*10^k + 83) / 3 is prime.at n=19A276322
- Wiener index of the n X n black bishop graph.at n=14A292051
- Number of non-isomorphic multiset partitions of weight n with all parts of odd size.at n=11A320664
- Expansion of Product_{i>=1, j>=1} (1 + x^(i*j*(j + 1)/2)).at n=40A327745
- a(n) = Sum_{x_1|n, x_2|n, x_3|n, x_4|n, x_5|n} gcd(x_1,x_2,x_3,x_4,x_5).at n=43A344139
- Number of integer partitions of n where the parts have the same median as the distinct parts.at n=45A360245
- Number of integer partitions of n whose second differences sum to 0, meaning either there is only one part, or the first two parts have the same difference as the last two parts.at n=44A360683
- Triangle read by rows: T(n,k) is the total number of bubbles of size k found in linear chord diagrams on 2n vertices.at n=49A367000
- Number of discrete uninorms defined on the finite chain L_n={0,1,...,n-1,n}.at n=6A367442