11942
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20496
- Proper Divisor Sum (Aliquot Sum)
- 8554
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5112
- Möbius Function
- -1
- Radical
- 11942
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- Bosonic string states.at n=36A005308
- Pseudo-random numbers: MS C 6.0 version.at n=17A084275
- Number of super unitary amicable pairs (i,j) with i<j and i<=10^n.at n=8A126163
- Expansion of x/(x^4 - 13x^3 + 36x^2 - 13x + 1).at n=5A187732
- Number of partitions of n in which any two parts differ by at most 7.at n=41A218509
- Sum_{k=1..n} (-1)^isprime(k)*2^k.at n=13A242002
- Number of 3 X 3 symmetric matrices with row and column sums <= n.at n=7A244865
- Number of unlabeled balanced rooted semi-identity trees with 2n-1 nodes and depth n.at n=21A306274
- Sum of the smallest parts in the partitions of n into 7 parts.at n=48A308927
- Number of multiset partitions of integer partitions of n where all parts have the same product.at n=28A320886
- Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that they form a convex quadrilateral.at n=48A334711
- Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that they form a convex quadrilateral.at n=51A334711
- Pascal-like triangle, where each entry is the sum of the four entries above it starting with 1 at the top.at n=56A356692
- Pascal-like triangle, where each entry is the sum of the four entries above it starting with 1 at the top.at n=64A356692
- a(n) is the least m such that A358052(m,k) = n for some k.at n=47A358055
- a(n) is the least m such that A358052(m,k) = n for some k.at n=48A358055
- a(n) is the least m such that A358052(m,k) = n for some k.at n=49A358055
- a(n) is the least m such that A358052(m,k) = n for some k.at n=50A358055
- a(n) is the least m such that A358052(m,k) = n for some k.at n=51A358055
- Expansion of 1 / Sum_{k>=0} x^(k*(5*k - 3)/2).at n=46A363149