11402
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17106
- Proper Divisor Sum (Aliquot Sum)
- 5704
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5700
- Möbius Function
- 1
- Radical
- 11402
- 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
- 29
- 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
- Coordination sequence for sigma-CrFe, Position Xf.at n=27A009958
- Numbers k such that the continued fraction for sqrt(k) has period 31.at n=39A020370
- Positive numbers k such that k and 3*k are anagrams in base 5 (written in base 5).at n=6A023062
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A001950 (upper Wythoff sequence).at n=35A024864
- Number of partitions in parts not of the form 23k, 23k+1 or 23k-1. Also number of partitions with no part of size 1 and differences between parts at distance 10 are greater than 1.at n=43A035989
- Numbers k such that k*k! - 1 is prime.at n=23A090704
- Semiprimes of the form 2*(m^2 + m + 1) (implying that m^2 + m + 1 is a prime).at n=25A107317
- a(n) = 2*a(n-1) - a(n-2) + n + 1.at n=39A121968
- Numbers n such that 30n-13, 30n-11, 30n-1, 30n+1, 30n+11, 30n+13 are all prime.at n=9A175683
- Number of n X 3 binary arrays with each 1 adjacent to exactly two 0's.at n=8A183331
- T(n,k) = Number of n X k binary arrays with each 1 adjacent to exactly two 0's.at n=57A183335
- Number of partitions of n in which any two parts differ by at most 10.at n=36A218512
- Number of partitions p of n such that the number of parts having multiplicity 1 is not a part and max(p) - min(p) is not a part.at n=40A241450
- Total number of points on a sphere when both poles are on an x by x grid where x=8*n+1.at n=37A254527
- Number of distinct products of distinct factorials up to n!.at n=16A255937
- Partial sums of A256970.at n=29A256971
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 249", based on the 5-celled von Neumann neighborhood.at n=24A271014
- Row sums of A273751.at n=26A274248
- Number of partitions of n such that each part is no more than 4 more than the sum of all smaller parts.at n=34A286097
- Number of multisets of exactly two partitions of positive integers into distinct parts with total sum of parts equal to n.at n=30A320787