11428
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 20006
- Proper Divisor Sum (Aliquot Sum)
- 8578
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5712
- Möbius Function
- 0
- Radical
- 5714
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 174
- 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
- a(n) = number of (s(0),s(1),...,s(n)) such that every s(i) is a nonnegative integer, s(0) = 1, s(n) = 3, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-2), where T is the array in A026120.at n=9A026124
- Number of connected numbers (A029827) with binary order (A029837) <= n.at n=15A036387
- Table T(n,k), n >= 0 and k >= 0, read by antidiagonals, related to A111146.at n=61A113143
- Row 4 of table A113143; equal to INVERT of quartic (or 4-fold) factorials shifted one place right.at n=6A113145
- Number of permutations of length n which avoid the patterns 1423, 3124, 3421.at n=9A116749
- Binomial transform of [1, 2, 3, 4, 0, 0, 0, ...].at n=26A139488
- T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=58A241255
- Number of 4Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=7A241258
- Numbers for which the cube of the sum of the digits is equal to the square of the product of their digits.at n=6A241846
- Number of length 5+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=18A248438
- Index of first occurrence of n in A280053, the nachos numbers based on squares.at n=9A280054
- Number of refinement-ordered pairs of strict integer partitions of n.at n=31A317142
- Number of parts in all partitions of n in which no part occurs more than four times.at n=26A320607
- Numbers k such that 393*2^k+1 is prime.at n=47A323041
- Number of colored integer partitions of n using all colors of an initial interval of the color palette such that each block of part i with multiplicity j has a pattern of i*j colors in (weakly) increasing order.at n=7A326654
- Numbers that are the sum of eight fourth powers in exactly six ways.at n=35A345838