16056
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 43680
- Proper Divisor Sum (Aliquot Sum)
- 27624
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5328
- Möbius Function
- 0
- Radical
- 1338
- Omega Function (Ω)
- 6
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- Differences between numbers k such that k and k+1 have the same sum of divisors.at n=33A054001
- Smallest number with persistence n for the sort-and-subtract-sequence.at n=19A065641
- Number of triangles in an n X n grid of squares with diagonals.at n=17A100583
- Expansion of x*(1+2*x)/(1+x+x^2-2*x^3).at n=24A103749
- Numbers k such that prime(k) == 13 (mod k).at n=12A116658
- Numbers k such that there is a bigger number m satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=31A124140
- Nonzero entries in the array on page 8 of the reference.at n=36A140878
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + j*prime(j)*T(n-2, k-1) with j=3, read by rows.at n=47A153648
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + j*prime(j)*T(n-2, k-1) with j=3, read by rows.at n=52A153648
- a(n) = 1458*n + 18.at n=10A157505
- Triangle related to the o.g.f.s. of the right-hand columns of A028421 (E(x,m=2,n)).at n=22A163937
- a(n) = n*(5*n^2 - 3*n + 4) / 6.at n=27A203552
- Number of partitions of n with difference -3 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=43A242689
- Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 1 3 4 6 or 7.at n=2A252237
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 1 3 4 6 or 7.at n=1A252238
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 1 3 4 6 or 7.at n=7A252243
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 1 3 4 6 or 7.at n=8A252243
- Let s denote the sum of the deficient numbers in the aliquot parts of x. Sequence lists numbers x such that sigma(s) = usigma(x), where usigma(x) is the sum of the unitary divisors of x (A034448).at n=8A258134
- Expansion of Product_{k>=1} (1 + x^(2*k-1))^(2*k-1).at n=28A262736
- Least number k = concat(x,y) such that k = n*x*y - x - y, -1 if such a number does not exist.at n=16A278935