11642
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17466
- Proper Divisor Sum (Aliquot Sum)
- 5824
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5820
- Möbius Function
- 1
- Radical
- 11642
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- Erroneous version of A342587.at n=16A008285
- G.f.: B(x/(1-x)) where B is g.f. of A000169.at n=5A038051
- Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .at n=44A052335
- Number of labeled order relations on n nodes in which longest chain has 2 nodes.at n=4A055531
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutations A085169/A085170.at n=13A086585
- Grow a binary tree using the following rules. Initially there is a single node labeled 1. At each step we add 1 to all labels less than 3. If a node has label 3 and zero or one descendants we add a new descendant labeled 1. Sequence gives sum of all labels at step n.at n=40A123015
- Numbers n with property that for each single digit d of n, we can also see the decimal expansion of 2^d as a substring of n. Also n may not contain any zero digits.at n=2A135016
- Numbers which converge to 2592 under repeated application of the powertrain map of A133500.at n=8A135384
- Number of chromatically nonunique simple graphs on n nodes.at n=7A137567
- Number of 2's in row n of A143589 (a Kolakoski fan).at n=26A143592
- Number of 2 X 2 matrices having all terms in {1,...,n} and determinant in the closed interval [0,n].at n=18A211057
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and antidiagonal neighbors in a random 0..1 nXk array.at n=37A220386
- Majority value maps: number of 2Xn binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and antidiagonal neighbors in a random 0..1 2Xn array.at n=7A220387
- Triangle T(n,k) of weakly graded (3+1)-free partially ordered sets (posets) on n labeled vertices with height k.at n=16A222866
- Number of (n+1)X(1+1) 0..3 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=3A232754
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=6A232756
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=9A232756
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=34A245208
- Number of length 3+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=16A250420
- Numbers k such that the decimal expansions of both k and k^2 have 1 as smallest digit and 6 as largest digit.at n=19A257197